43   ASSERT_TRUE(NULL == u1->first_in);  in TEST_F()
44   ASSERT_TRUE(NULL == u1->first_out);  in TEST_F()
46   ASSERT_TRUE(NULL == u1->next);  in TEST_F()
48   ASSERT_TRUE(NULL == u2->first_in);  in TEST_F()
49   ASSERT_TRUE(NULL == u2->first_out);  in TEST_F()
53   ASSERT_TRUE(NULL == u3->first_in);  in TEST_F()
54   ASSERT_TRUE(NULL == u3->first_out);  in TEST_F()
56   ASSERT_TRUE(NULL == u3->prev);  in TEST_F()
58   ListDigraph::Node* head = NULL;  in TEST_F()
64   ASSERT_TRUE(NULL == u1->first_in);  in TEST_F()
65   ASSERT_TRUE(NULL == u1->first_out);  in TEST_F()
67   ASSERT_TRUE(NULL == u1->next);  in TEST_F()
69   ASSERT_TRUE(NULL == u3->first_in);  in TEST_F()
70   ASSERT_TRUE(NULL == u3->first_out);  in TEST_F()
72   ASSERT_TRUE(NULL == u3->prev);  in TEST_F()
74   ASSERT_TRUE(NULL == u2->first_in);  in TEST_F()
75   ASSERT_TRUE(NULL == u2->first_out);  in TEST_F()
76   ASSERT_TRUE(NULL == u2->prev);  in TEST_F()
77   ASSERT_TRUE(NULL == u2->next);  in TEST_F()
90   ASSERT_TRUE(NULL == u1->first_in);  in TEST_F()
91   ASSERT_TRUE(NULL == u1->first_out);  in TEST_F()
93   ASSERT_TRUE(NULL == u1->next);  in TEST_F()
95   ASSERT_TRUE(NULL == u2->first_in);  in TEST_F()
96   ASSERT_TRUE(NULL == u2->first_out);  in TEST_F()
100   ASSERT_TRUE(NULL == u3->first_in);  in TEST_F()
101   ASSERT_TRUE(NULL == u3->first_out);  in TEST_F()
103   ASSERT_TRUE(NULL == u3->prev);  in TEST_F()
105   ListDigraph::Node* head = NULL;  in TEST_F()
111   ASSERT_TRUE(NULL == u1->first_in);  in TEST_F()
112   ASSERT_TRUE(NULL == u1->first_out);  in TEST_F()
113   ASSERT_TRUE(NULL == u1->prev);  in TEST_F()
114   ASSERT_TRUE(NULL == u1->next);  in TEST_F()
116   ASSERT_TRUE(NULL == u2->first_in);  in TEST_F()
117   ASSERT_TRUE(NULL == u2->first_out);  in TEST_F()
119   ASSERT_TRUE(NULL == u2->next);  in TEST_F()
121   ASSERT_TRUE(NULL == u3->first_in);  in TEST_F()
122   ASSERT_TRUE(NULL == u3->first_out);  in TEST_F()
124   ASSERT_TRUE(NULL == u3->prev);  in TEST_F()
137   ASSERT_TRUE(NULL == u1->first_in);  in TEST_F()
138   ASSERT_TRUE(NULL == u1->first_out);  in TEST_F()
140   ASSERT_TRUE(NULL == u1->next);  in TEST_F()
142   ASSERT_TRUE(NULL == u2->first_in);  in TEST_F()
143   ASSERT_TRUE(NULL == u2->first_out);  in TEST_F()
147   ASSERT_TRUE(NULL == u3->first_in);  in TEST_F()
148   ASSERT_TRUE(NULL == u3->first_out);  in TEST_F()
150   ASSERT_TRUE(NULL == u3->prev);  in TEST_F()
152   ListDigraph::Node* head = NULL;  in TEST_F()
158   ASSERT_TRUE(NULL == u3->first_in);  in TEST_F()
159   ASSERT_TRUE(NULL == u3->first_out);  in TEST_F()
160   ASSERT_TRUE(NULL == u3->prev);  in TEST_F()
161   ASSERT_TRUE(NULL == u3->next);  in TEST_F()
163   ASSERT_TRUE(NULL == u1->first_in);  in TEST_F()
164   ASSERT_TRUE(NULL == u1->first_out);  in TEST_F()
166   ASSERT_TRUE(NULL == u1->next);  in TEST_F()
168   ASSERT_TRUE(NULL == u2->first_in);  in TEST_F()
169   ASSERT_TRUE(NULL == u2->first_out);  in TEST_F()
171   ASSERT_TRUE(NULL == u2->prev);  in TEST_F()
213   ASSERT_TRUE(u2->first_in == a2 && u2->first_out == NULL);  in TEST_F()
214   ASSERT_TRUE(u3->first_in == a3 && u3->first_out == NULL);  in TEST_F()
234   ASSERT_TRUE(u2->first_in == a1 && u2->first_out == NULL);  in TEST_F()
237   ASSERT_TRUE(u3->first_in == NULL && u3->first_out == a3);  in TEST_F()
240   ASSERT_TRUE(NULL == a2->next_in);  in TEST_F()
260   ASSERT_TRUE(u1->first_in == a3 && u1->first_out == NULL);  in TEST_F()
263   ASSERT_TRUE(u2->first_in == NULL && u2->first_out == a2);  in TEST_F()
266   ASSERT_TRUE(NULL == a1->next_in);  in TEST_F()
286   ASSERT_TRUE(u1->first_in == NULL && u1->first_out == a1);  in TEST_F()
289   ASSERT_TRUE(u3->first_in == a2 && u3->first_out == NULL);  in TEST_F()
292   ASSERT_TRUE(NULL == a3->next_in);  in TEST_F()
308   ASSERT_TRUE(u2->first_in == NULL);  in TEST_F()
309   ASSERT_TRUE(u3->first_in == NULL);  in TEST_F()
310   ASSERT_TRUE(a1->next_in == NULL);  in TEST_F()