| cycle_breaker_unittest.cc | 78 set<Edge> broken_edges; local
79 breaker.BreakCycles(graph, &broken_edges);
86 EXPECT_TRUE(utils::SetContainsKey(broken_edges, make_pair(n_a, n_e)) ||
87 utils::SetContainsKey(broken_edges, make_pair(n_e, n_b)) ||
88 utils::SetContainsKey(broken_edges, make_pair(n_b, n_a)));
89 EXPECT_TRUE(utils::SetContainsKey(broken_edges, make_pair(n_c, n_d)) ||
90 utils::SetContainsKey(broken_edges, make_pair(n_d, n_e)) ||
91 utils::SetContainsKey(broken_edges, make_pair(n_e, n_c)));
92 EXPECT_TRUE(utils::SetContainsKey(broken_edges, make_pair(n_g, n_h)) ||
93 utils::SetContainsKey(broken_edges, make_pair(n_h, n_g)))
164 set<Edge> broken_edges; local
216 set<Edge> broken_edges; local
247 set<Edge> broken_edges; local
272 set<Edge> broken_edges; local
[all...] |
