Lines Matching refs:a3
186 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F() local
190 ASSERT_TRUE(u3 == a3->source && u1 == a3->target); in TEST_F()
192 ASSERT_TRUE(u1->first_in == a3 && u1->first_out == a1); in TEST_F()
194 ASSERT_TRUE(u3->first_in == a2 && u3->first_out == a3); in TEST_F()
206 ListDigraph::Arc* a3 = graph.addArc(*u1, *u3); in TEST_F() local
210 ASSERT_TRUE(u1 == a3->source && u3 == a3->target); in TEST_F()
212 ASSERT_TRUE(u1->first_in == a1 && u1->first_out == a3); in TEST_F()
214 ASSERT_TRUE(u3->first_in == a3 && u3->first_out == NULL); in TEST_F()
226 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F() local
231 ASSERT_TRUE(u3 == a3->source && u1 == a3->target); in TEST_F()
237 ASSERT_TRUE(u3->first_in == NULL && u3->first_out == a3); in TEST_F()
252 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F() local
257 ASSERT_TRUE(u3 == a3->source && u1 == a3->target); in TEST_F()
260 ASSERT_TRUE(u1->first_in == a3 && u1->first_out == NULL); in TEST_F()
278 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F() local
280 graph.erase(*a3); in TEST_F()
292 ASSERT_TRUE(NULL == a3->next_in); in TEST_F()