#include <max_cardinality_matching.hpp>
Classes | |
struct | map_vertex_to_ |
Public Types | |
typedef graph_traits< Graph > ::vertex_descriptor | vertex_descriptor_t |
typedef std::pair < vertex_descriptor_t, vertex_descriptor_t > | vertex_pair_t |
typedef graph_traits< Graph > ::edge_descriptor | edge_descriptor_t |
typedef graph_traits< Graph > ::vertices_size_type | v_size_t |
typedef graph_traits< Graph > ::edges_size_type | e_size_t |
typedef graph_traits< Graph > ::vertex_iterator | vertex_iterator_t |
typedef graph_traits< Graph > ::out_edge_iterator | out_edge_iterator_t |
typedef std::deque < vertex_descriptor_t > | vertex_list_t |
typedef std::vector < edge_descriptor_t > | edge_list_t |
typedef map_vertex_to_ < vertex_descriptor_t >::type | vertex_to_vertex_map_t |
typedef map_vertex_to_< int >::type | vertex_to_int_map_t |
typedef map_vertex_to_ < vertex_pair_t >::type | vertex_to_vertex_pair_map_t |
typedef map_vertex_to_ < v_size_t >::type | vertex_to_vsize_map_t |
typedef map_vertex_to_ < e_size_t >::type | vertex_to_esize_map_t |
Public Member Functions | |
edmonds_augmenting_path_finder (const Graph &arg_g, MateMap arg_mate, VertexIndexMap arg_vm) | |
bool | augment_matching () |
template<typename PropertyMap > | |
void | get_current_matching (PropertyMap pm) |
template<typename PropertyMap > | |
void | get_vertex_state_map (PropertyMap pm) |
typedef graph_traits<Graph>::edges_size_type boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::e_size_t |
typedef graph_traits<Graph>::edge_descriptor boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::edge_descriptor_t |
typedef std::vector<edge_descriptor_t> boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::edge_list_t |
typedef graph_traits<Graph>::out_edge_iterator boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::out_edge_iterator_t |
typedef graph_traits<Graph>::vertices_size_type boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::v_size_t |
typedef graph_traits<Graph>::vertex_descriptor boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::vertex_descriptor_t |
typedef graph_traits<Graph>::vertex_iterator boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::vertex_iterator_t |
typedef std::deque<vertex_descriptor_t> boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::vertex_list_t |
typedef std::pair< vertex_descriptor_t, vertex_descriptor_t > boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::vertex_pair_t |
typedef map_vertex_to_<e_size_t>::type boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::vertex_to_esize_map_t |
typedef map_vertex_to_<int>::type boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::vertex_to_int_map_t |
typedef map_vertex_to_<vertex_descriptor_t>::type boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::vertex_to_vertex_map_t |
typedef map_vertex_to_<vertex_pair_t>::type boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::vertex_to_vertex_pair_map_t |
typedef map_vertex_to_<v_size_t>::type boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::vertex_to_vsize_map_t |
|
inline |
References boost::vertices().
|
inline |
References boost::a, boost::asio::b, boost::disjoint_sets< RankPA, ParentPA, FindCompress >::find_set(), boost::xpressive::make_pair, boost::disjoint_sets< RankPA, ParentPA, FindCompress >::make_set(), boost::out_edges(), boost::source(), boost::swap, boost::target(), boost::graph::detail::V_EVEN, boost::graph::detail::V_ODD, boost::graph::detail::V_UNREACHED, and boost::vertices().
Referenced by boost::maximum_cardinality_matching_verifier< Graph, MateMap, VertexIndexMap >::verify_matching().
|
inline |
References boost::put(), and boost::vertices().
|
inline |