Lines Matching refs:a2
185 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F() local
189 ASSERT_TRUE(u2 == a2->source && u3 == a2->target); in TEST_F()
193 ASSERT_TRUE(u2->first_in == a1 && u2->first_out == a2); in TEST_F()
194 ASSERT_TRUE(u3->first_in == a2 && u3->first_out == a3); in TEST_F()
205 ListDigraph::Arc* a2 = graph.addArc(*u1, *u2); in TEST_F() local
209 ASSERT_TRUE(u1 == a2->source && u2 == a2->target); in TEST_F()
213 ASSERT_TRUE(u2->first_in == a2 && u2->first_out == NULL); in TEST_F()
225 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F() local
228 graph.erase(*a2); in TEST_F()
240 ASSERT_TRUE(NULL == a2->next_in); in TEST_F()
251 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F() local
256 ASSERT_TRUE(u2 == a2->source && u3 == a2->target); in TEST_F()
263 ASSERT_TRUE(u2->first_in == NULL && u2->first_out == a2); in TEST_F()
277 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F() local
283 ASSERT_TRUE(u2 == a2->source && u3 == a2->target); in TEST_F()
289 ASSERT_TRUE(u3->first_in == a2 && u3->first_out == NULL); in TEST_F()