Lines Matching refs:Graph
5994 template <typename Graph>
5998 explicit BacktrackingMaxBPMState(const Graph* g) : graph_(g) { }
6057 const Graph* graph_; // not owned
6064 template <typename Graph>
6065 const size_t BacktrackingMaxBPMState<Graph>::kUnused;
6071 template <typename Graph>
6073 FindBacktrackingMaxBPM(const Graph& g) {
6074 return BacktrackingMaxBPMState<Graph>(&g).Compute();
6086 MatchMatrix graph(nodes, nodes);
6089 internal::FindMaxBipartiteMatching(graph);
6090 EXPECT_EQ(FindBacktrackingMaxBPM(graph).size(), matches.size())
6091 << "graph: " << graph.DebugString();
6092 // Check that all elements of matches are in the graph.
6094 std::vector<bool> seen_element(graph.LhsSize());
6095 std::vector<bool> seen_matcher(graph.RhsSize());
6100 EXPECT_TRUE(graph.HasEdge(ilhs, irhs));
6106 } while (graph.NextGraph());
6140 MatchMatrix graph(nlhs, nrhs);
6142 EXPECT_EQ(FindBacktrackingMaxBPM(graph).size(),
6143 internal::FindMaxBipartiteMatching(graph).size())
6144 << "graph: " << graph.DebugString()
6146 << PrintToString(FindBacktrackingMaxBPM(graph))
6148 << PrintToString(internal::FindMaxBipartiteMatching(graph));
6149 } while (graph.NextGraph());
6171 MatchMatrix graph(nodes, nodes);
6180 graph.Randomize();
6181 EXPECT_EQ(FindBacktrackingMaxBPM(graph).size(),
6182 internal::FindMaxBipartiteMatching(graph).size())
6183 << " graph: " << graph.DebugString()
