Lines Matching refs:graph_cycles
196 GraphCycles graph_cycles; in TEST() local
210 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), ptr(node)) << " node " << node; in TEST()
212 CheckEdges(&nodes, &edges, id, &graph_cycles); in TEST()
213 CheckTransitiveClosure(&nodes, &edges, id, &graph_cycles); in TEST()
219 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
222 ASSERT_EQ(ptr(new_node), graph_cycles.Ptr(new_gnode)); in TEST()
233 graph_cycles.RemoveNode(ptr(node)); in TEST()
234 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), nullptr); in TEST()
253 if (graph_cycles.InsertEdge(id[nodes[from]], id[nodes[to]])) { in TEST()
276 graph_cycles.RemoveEdge(id[from], id[to]); in TEST()
285 int path_len = graph_cycles.FindPath(id[nodes[from]], id[nodes[to]], in TEST()
290 graph_cycles.IsReachable(Get(id, nodes[from]), Get(id, nodes[to])); in TEST()
301 ASSERT_TRUE(graph_cycles.HasEdge(path[i-1], path[i])); in TEST()
308 CheckInvariants(graph_cycles); in TEST()
318 CheckEdges(&nodes, &edges, id, &graph_cycles); in TEST()
319 CheckTransitiveClosure(&nodes, &edges, id, &graph_cycles); in TEST()
322 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
325 ASSERT_EQ(ptr(new_node), graph_cycles.Ptr(new_gnode)); in TEST()
337 graph_cycles.RemoveNode(ptr(node)); in TEST()
349 CheckInvariants(graph_cycles); in TEST()