Lines Matching refs:graph
501 MatchMatrix graph(nodes, nodes); in TEST_P() local
503 ElementMatcherPairs matches = internal::FindMaxBipartiteMatching(graph); in TEST_P()
504 EXPECT_EQ(FindBacktrackingMaxBPM(graph).size(), matches.size()) in TEST_P()
505 << "graph: " << graph.DebugString(); in TEST_P()
508 std::vector<bool> seen_element(graph.LhsSize()); in TEST_P()
509 std::vector<bool> seen_matcher(graph.RhsSize()); in TEST_P()
514 EXPECT_TRUE(graph.HasEdge(ilhs, irhs)); in TEST_P()
520 } while (graph.NextGraph()); in TEST_P()
553 MatchMatrix graph(nlhs, nrhs); in TEST_P() local
555 EXPECT_EQ(FindBacktrackingMaxBPM(graph).size(), in TEST_P()
556 internal::FindMaxBipartiteMatching(graph).size()) in TEST_P()
557 << "graph: " << graph.DebugString() in TEST_P()
558 << "\nbacktracking: " << PrintToString(FindBacktrackingMaxBPM(graph)) in TEST_P()
560 << PrintToString(internal::FindMaxBipartiteMatching(graph)); in TEST_P()
561 } while (graph.NextGraph()); in TEST_P()
578 MatchMatrix graph(static_cast<size_t>(nodes), static_cast<size_t>(nodes)); in TEST_P() local
587 graph.Randomize(); in TEST_P()
588 EXPECT_EQ(FindBacktrackingMaxBPM(graph).size(), in TEST_P()
589 internal::FindMaxBipartiteMatching(graph).size()) in TEST_P()
590 << " graph: " << graph.DebugString() in TEST_P()