Lines Matching defs:u2
40 ListDigraph::Node* u2 = graph.addNode();
45 ASSERT_TRUE(u2 == u1->prev);
48 ASSERT_TRUE(NULL == u2->first_in);
49 ASSERT_TRUE(NULL == u2->first_out);
50 ASSERT_TRUE(u3 == u2->prev);
51 ASSERT_TRUE(u1 == u2->next);
55 ASSERT_TRUE(u2 == u3->next);
62 graph.erase(*u2);
74 ASSERT_TRUE(NULL == u2->first_in);
75 ASSERT_TRUE(NULL == u2->first_out);
76 ASSERT_TRUE(NULL == u2->prev);
77 ASSERT_TRUE(NULL == u2->next);
87 ListDigraph::Node* u2 = graph.addNode();
92 ASSERT_TRUE(u2 == u1->prev);
95 ASSERT_TRUE(NULL == u2->first_in);
96 ASSERT_TRUE(NULL == u2->first_out);
97 ASSERT_TRUE(u3 == u2->prev);
98 ASSERT_TRUE(u1 == u2->next);
102 ASSERT_TRUE(u2 == u3->next);
116 ASSERT_TRUE(NULL == u2->first_in);
117 ASSERT_TRUE(NULL == u2->first_out);
118 ASSERT_TRUE(u3 == u2->prev);
119 ASSERT_TRUE(NULL == u2->next);
123 ASSERT_TRUE(u2 == u3->next);
134 ListDigraph::Node* u2 = graph.addNode();
139 ASSERT_TRUE(u2 == u1->prev);
142 ASSERT_TRUE(NULL == u2->first_in);
143 ASSERT_TRUE(NULL == u2->first_out);
144 ASSERT_TRUE(u3 == u2->prev);
145 ASSERT_TRUE(u1 == u2->next);
149 ASSERT_TRUE(u2 == u3->next);
165 ASSERT_TRUE(u2 == u1->prev);
168 ASSERT_TRUE(NULL == u2->first_in);
169 ASSERT_TRUE(NULL == u2->first_out);
170 ASSERT_TRUE(u1 == u2->next);
171 ASSERT_TRUE(NULL == u2->prev);
174 ASSERT_TRUE(head == u2);
181 ListDigraph::Node* u2 = graph.addNode();
184 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2);
185 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3);
188 ASSERT_TRUE(u1 == a1->source && u2 == a1->target);
189 ASSERT_TRUE(u2 == a2->source && u3 == a2->target);
193 ASSERT_TRUE(u2->first_in == a1 && u2->first_out == a2);
201 ListDigraph::Node* u2 = graph.addNode();
205 ListDigraph::Arc* a2 = graph.addArc(*u1, *u2);
209 ASSERT_TRUE(u1 == a2->source && u2 == a2->target);
213 ASSERT_TRUE(u2->first_in == a2 && u2->first_out == NULL);
221 ListDigraph::Node* u2 = graph.addNode();
224 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2);
225 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3);
230 ASSERT_TRUE(u1 == a1->source && u2 == a1->target);
234 ASSERT_TRUE(u2->first_in == a1 && u2->first_out == NULL);
247 ListDigraph::Node* u2 = graph.addNode();
250 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2);
251 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3);
256 ASSERT_TRUE(u2 == a2->source && u3 == a2->target);
263 ASSERT_TRUE(u2->first_in == NULL && u2->first_out == a2);
273 ListDigraph::Node* u2 = graph.addNode();
276 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2);
277 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3);
282 ASSERT_TRUE(u1 == a1->source && u2 == a1->target);
283 ASSERT_TRUE(u2 == a2->source && u3 == a2->target);
299 ListDigraph::Node* u2 = graph.addNode();
303 graph.addArc(*u1, *u2);
308 ASSERT_TRUE(u2->first_in == NULL);