Lines Matching defs:u3
41 ListDigraph::Node* u3 = graph.addNode();
50 ASSERT_TRUE(u3 == u2->prev);
53 ASSERT_TRUE(NULL == u3->first_in);
54 ASSERT_TRUE(NULL == u3->first_out);
55 ASSERT_TRUE(u2 == u3->next);
56 ASSERT_TRUE(NULL == u3->prev);
60 ASSERT_TRUE(head == u3);
66 ASSERT_TRUE(u3 == u1->prev);
69 ASSERT_TRUE(NULL == u3->first_in);
70 ASSERT_TRUE(NULL == u3->first_out);
71 ASSERT_TRUE(u1 == u3->next);
72 ASSERT_TRUE(NULL == u3->prev);
80 ASSERT_TRUE(head == u3);
88 ListDigraph::Node* u3 = graph.addNode();
97 ASSERT_TRUE(u3 == u2->prev);
100 ASSERT_TRUE(NULL == u3->first_in);
101 ASSERT_TRUE(NULL == u3->first_out);
102 ASSERT_TRUE(u2 == u3->next);
103 ASSERT_TRUE(NULL == u3->prev);
107 ASSERT_TRUE(head == u3);
118 ASSERT_TRUE(u3 == u2->prev);
121 ASSERT_TRUE(NULL == u3->first_in);
122 ASSERT_TRUE(NULL == u3->first_out);
123 ASSERT_TRUE(u2 == u3->next);
124 ASSERT_TRUE(NULL == u3->prev);
127 ASSERT_TRUE(head == u3);
135 ListDigraph::Node* u3 = graph.addNode();
144 ASSERT_TRUE(u3 == u2->prev);
147 ASSERT_TRUE(NULL == u3->first_in);
148 ASSERT_TRUE(NULL == u3->first_out);
149 ASSERT_TRUE(u2 == u3->next);
150 ASSERT_TRUE(NULL == u3->prev);
154 ASSERT_TRUE(head == u3);
156 graph.erase(*u3);
158 ASSERT_TRUE(NULL == u3->first_in);
159 ASSERT_TRUE(NULL == u3->first_out);
160 ASSERT_TRUE(NULL == u3->prev);
161 ASSERT_TRUE(NULL == u3->next);
182 ListDigraph::Node* u3 = graph.addNode();
185 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3);
186 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1);
189 ASSERT_TRUE(u2 == a2->source && u3 == a2->target);
190 ASSERT_TRUE(u3 == a3->source && u1 == a3->target);
194 ASSERT_TRUE(u3->first_in == a2 && u3->first_out == a3);
202 ListDigraph::Node* u3 = graph.addNode();
206 ListDigraph::Arc* a3 = graph.addArc(*u1, *u3);
210 ASSERT_TRUE(u1 == a3->source && u3 == a3->target);
214 ASSERT_TRUE(u3->first_in == a3 && u3->first_out == NULL);
222 ListDigraph::Node* u3 = graph.addNode();
225 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3);
226 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1);
231 ASSERT_TRUE(u3 == a3->source && u1 == a3->target);
237 ASSERT_TRUE(u3->first_in == NULL && u3->first_out == a3);
248 ListDigraph::Node* u3 = graph.addNode();
251 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3);
252 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1);
256 ASSERT_TRUE(u2 == a2->source && u3 == a2->target);
257 ASSERT_TRUE(u3 == a3->source && u1 == a3->target);
274 ListDigraph::Node* u3 = graph.addNode();
277 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3);
278 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1);
283 ASSERT_TRUE(u2 == a2->source && u3 == a2->target);
289 ASSERT_TRUE(u3->first_in == a2 && u3->first_out == NULL);
300 ListDigraph::Node* u3 = graph.addNode();
304 graph.addArc(*u1, *u3);
309 ASSERT_TRUE(u3->first_in == NULL);
