Home
last modified time | relevance | path

Searched refs:mate2 (Results 1 – 1 of 1) sorted by relevance

/third_party/boost/libs/graph/example/
Dweighted_matching_example.cpp81 mate2(n_vertices); in main() local
101 brute_force_maximum_weighted_matching(g, &mate2[0]); in main()
105 std::cout << "Matching size is " << matching_size(g, &mate2[0]) in main()
106 << ", total weight is " << matching_weight_sum(g, &mate2[0]) in main()
112 if (mate2[*vi] != graph_traits< my_graph >::null_vertex() in main()
113 && *vi < mate2[*vi]) in main()
114 std::cout << "{" << *vi << ", " << mate2[*vi] << "}" << std::endl; in main()
118 matching_weight_sum(g, &mate1[0]) == matching_weight_sum(g, &mate2[0])); in main()