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

#include <max_cardinality_matching.hpp>

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

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::greedy_matching< Graph, MateMap >::edge_descriptor_t

template<typename Graph , typename MateMap >

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

template<typename Graph , typename MateMap >

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

template<typename Graph , typename MateMap >

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

Member Function Documentation

template<typename Graph , typename MateMap >

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

inlinestatic

References boost::edges(), boost::put(), boost::source(), 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