Lines Matching refs:a1
193 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2); in TEST_F() local
197 ASSERT_TRUE(u1 == a1->source && u2 == a1->target); in TEST_F()
201 ASSERT_TRUE(u1->first_in == a3 && u1->first_out == a1); in TEST_F()
202 ASSERT_TRUE(u2->first_in == a1 && u2->first_out == a2); in TEST_F()
214 ListDigraph::Arc* a1 = graph.addArc(*u1, *u1); in TEST_F() local
218 ASSERT_TRUE(u1 == a1->source && u1 == a1->target); in TEST_F()
222 ASSERT_TRUE(u1->first_in == a1 && u1->first_out == a3); in TEST_F()
235 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2); in TEST_F() local
241 ASSERT_TRUE(u1 == a1->source && u2 == a1->target); in TEST_F()
245 ASSERT_TRUE(u2->first_in == a1 && u2->first_out == NULL); in TEST_F()
263 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2); in TEST_F() local
267 graph.erase(*a1); in TEST_F()
279 ASSERT_TRUE(NULL == a1->next_in); in TEST_F()
290 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2); in TEST_F() local
296 ASSERT_TRUE(u1 == a1->source && u2 == a1->target); in TEST_F()
300 ASSERT_TRUE(u1->first_in == NULL && u1->first_out == a1); in TEST_F()
317 ListDigraph::Arc* a1 = graph.addArc(*u1, *u1); in TEST_F() local
325 ASSERT_TRUE(a1->next_in == NULL); in TEST_F()