max_cardinality_matching.hpp File Reference

#include <vector>
#include <list>
#include <deque>
#include <algorithm>
#include <utility>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/visitors.hpp>
#include <boost/graph/depth_first_search.hpp>
#include <boost/graph/filtered_graph.hpp>
#include <boost/pending/disjoint_sets.hpp>
#include <boost/assert.hpp>

Include dependency graph for max_cardinality_matching.hpp:

Classes
struct	boost::no_augmenting_path_finder< Graph, MateMap, VertexIndexMap >
class	boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >
struct	boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::map_vertex_to_< X >
struct	boost::greedy_matching< Graph, MateMap >
struct	boost::extra_greedy_matching< Graph, MateMap >
struct	boost::extra_greedy_matching< Graph, MateMap >::select_first
struct	boost::extra_greedy_matching< Graph, MateMap >::select_second
class	boost::extra_greedy_matching< Graph, MateMap >::less_than_by_degree< PairSelector >
struct	boost::empty_matching< Graph, MateMap >
class	boost::detail::odd_components_counter< SizeType >
struct	boost::no_matching_verifier< Graph, MateMap, VertexIndexMap >
struct	boost::maximum_cardinality_matching_verifier< Graph, MateMap, VertexIndexMap >
struct	boost::maximum_cardinality_matching_verifier< Graph, MateMap, VertexIndexMap >::map_vertex_to_< X >
struct	boost::maximum_cardinality_matching_verifier< Graph, MateMap, VertexIndexMap >::non_odd_vertex< VertexStateMap >

Namespaces
	boost
	Duration formatting facet for input.
	boost::graph
	boost::graph::detail
	boost::detail

Enumerations
enum	{   boost::graph::detail::V_EVEN,   boost::graph::detail::V_ODD,   boost::graph::detail::V_UNREACHED }

Functions
template<typename Graph , typename MateMap , typename VertexIndexMap >
graph_traits< Graph > ::vertices_size_type	boost::matching_size (const Graph &g, MateMap mate, VertexIndexMap vm)
template<typename Graph , typename MateMap >
graph_traits< Graph > ::vertices_size_type	boost::matching_size (const Graph &g, MateMap mate)
template<typename Graph , typename MateMap , typename VertexIndexMap >
bool	boost::is_a_matching (const Graph &g, MateMap mate, VertexIndexMap)
template<typename Graph , typename MateMap >
bool	boost::is_a_matching (const Graph &g, MateMap mate)
template<typename Graph , typename MateMap , typename VertexIndexMap , template< typename, typename, typename > class AugmentingPathFinder, template< typename, typename > class InitialMatchingFinder, template< typename, typename, typename > class MatchingVerifier>
bool	boost::matching (const Graph &g, MateMap mate, VertexIndexMap vm)
template<typename Graph , typename MateMap , typename VertexIndexMap >
bool	boost::checked_edmonds_maximum_cardinality_matching (const Graph &g, MateMap mate, VertexIndexMap vm)
template<typename Graph , typename MateMap >
bool	boost::checked_edmonds_maximum_cardinality_matching (const Graph &g, MateMap mate)
template<typename Graph , typename MateMap , typename VertexIndexMap >
void	boost::edmonds_maximum_cardinality_matching (const Graph &g, MateMap mate, VertexIndexMap vm)
template<typename Graph , typename MateMap >
void	boost::edmonds_maximum_cardinality_matching (const Graph &g, MateMap mate)