boost::extra_greedy_matching< Graph, MateMap >::less_than_by_degree< PairSelector > Class Template Reference

#include <max_cardinality_matching.hpp>

Public Member Functions
	less_than_by_degree (const Graph &g)
bool	operator() (const vertex_pair_t x, const vertex_pair_t y)

Constructor & Destructor Documentation

template<typename Graph , typename MateMap >

template<class PairSelector >

boost::extra_greedy_matching< Graph, MateMap >::less_than_by_degree< PairSelector >::less_than_by_degree ( const Graph &  g )

inline

Member Function Documentation

template<typename Graph , typename MateMap >

template<class PairSelector >

bool boost::extra_greedy_matching< Graph, MateMap >::less_than_by_degree< PairSelector >::operator() ( const vertex_pair_t  x, const vertex_pair_t  y  )

inline

References boost::out_degree().

---

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

• boost_1_57_0/boost/graph/max_cardinality_matching.hpp