Lines Matching refs:a1
184 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2); in TEST_F() local
188 ASSERT_TRUE(u1 == a1->source && u2 == a1->target); in TEST_F()
192 ASSERT_TRUE(u1->first_in == a3 && u1->first_out == a1); in TEST_F()
193 ASSERT_TRUE(u2->first_in == a1 && u2->first_out == a2); in TEST_F()
204 ListDigraph::Arc* a1 = graph.addArc(*u1, *u1); in TEST_F() local
208 ASSERT_TRUE(u1 == a1->source && u1 == a1->target); in TEST_F()
212 ASSERT_TRUE(u1->first_in == a1 && u1->first_out == a3); in TEST_F()
224 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2); in TEST_F() local
230 ASSERT_TRUE(u1 == a1->source && u2 == a1->target); in TEST_F()
234 ASSERT_TRUE(u2->first_in == a1 && u2->first_out == NULL); in TEST_F()
250 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2); in TEST_F() local
254 graph.erase(*a1); in TEST_F()
266 ASSERT_TRUE(NULL == a1->next_in); in TEST_F()
276 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2); in TEST_F() local
282 ASSERT_TRUE(u1 == a1->source && u2 == a1->target); in TEST_F()
286 ASSERT_TRUE(u1->first_in == NULL && u1->first_out == a1); in TEST_F()
302 ListDigraph::Arc* a1 = graph.addArc(*u1, *u1); in TEST_F() local
310 ASSERT_TRUE(a1->next_in == NULL); in TEST_F()