boost::extra_greedy_matching< Graph, MateMap > Struct Template Reference

#include <max_cardinality_matching.hpp>

Classes
class	less_than_by_degree
struct	select_first
struct	select_second

Public Types
typedef graph_traits< Graph > ::vertex_descriptor	vertex_descriptor_t
typedef graph_traits< Graph > ::vertex_iterator	vertex_iterator_t
typedef graph_traits< Graph > ::edge_descriptor	edge_descriptor_t
typedef graph_traits< Graph > ::edge_iterator	edge_iterator_t
typedef std::pair < vertex_descriptor_t, vertex_descriptor_t >	vertex_pair_t

Static Public Member Functions
static void	find_matching (const Graph &g, MateMap mate)

Member Typedef Documentation

template<typename Graph , typename MateMap >

typedef graph_traits< Graph >::edge_descriptor boost::extra_greedy_matching< Graph, MateMap >::edge_descriptor_t

template<typename Graph , typename MateMap >

typedef graph_traits< Graph >::edge_iterator boost::extra_greedy_matching< Graph, MateMap >::edge_iterator_t

template<typename Graph , typename MateMap >

typedef graph_traits< Graph >::vertex_descriptor boost::extra_greedy_matching< Graph, MateMap >::vertex_descriptor_t

template<typename Graph , typename MateMap >

typedef graph_traits< Graph >::vertex_iterator boost::extra_greedy_matching< Graph, MateMap >::vertex_iterator_t

template<typename Graph , typename MateMap >

typedef std::pair<vertex_descriptor_t, vertex_descriptor_t> boost::extra_greedy_matching< Graph, MateMap >::vertex_pair_t

Member Function Documentation

template<typename Graph , typename MateMap >

static void boost::extra_greedy_matching< Graph, MateMap >::find_matching ( const Graph &  g, MateMap  mate  )

inlinestatic

References boost::edges(), boost::xpressive::make_pair, boost::put(), boost::source(), boost::range::stable_sort(), boost::target(), and boost::vertices().

---

The documentation for this struct was generated from the following file:

• boost_1_57_0/boost/graph/max_cardinality_matching.hpp