Lines Matching refs:graph
15 using namespace mcld::graph;
37 ListDigraph graph; in TEST_F() local
39 ListDigraph::Node* u1 = graph.addNode(); in TEST_F()
40 ListDigraph::Node* u2 = graph.addNode(); in TEST_F()
41 ListDigraph::Node* u3 = graph.addNode(); in TEST_F()
59 graph.getHead(head); in TEST_F()
62 graph.erase(*u2); in TEST_F()
79 graph.getHead(head); in TEST_F()
84 ListDigraph graph; in TEST_F() local
86 ListDigraph::Node* u1 = graph.addNode(); in TEST_F()
87 ListDigraph::Node* u2 = graph.addNode(); in TEST_F()
88 ListDigraph::Node* u3 = graph.addNode(); in TEST_F()
106 graph.getHead(head); in TEST_F()
109 graph.erase(*u1); in TEST_F()
126 graph.getHead(head); in TEST_F()
131 ListDigraph graph; in TEST_F() local
133 ListDigraph::Node* u1 = graph.addNode(); in TEST_F()
134 ListDigraph::Node* u2 = graph.addNode(); in TEST_F()
135 ListDigraph::Node* u3 = graph.addNode(); in TEST_F()
153 graph.getHead(head); in TEST_F()
156 graph.erase(*u3); in TEST_F()
173 graph.getHead(head); in TEST_F()
178 ListDigraph graph; in TEST_F() local
180 ListDigraph::Node* u1 = graph.addNode(); in TEST_F()
181 ListDigraph::Node* u2 = graph.addNode(); in TEST_F()
182 ListDigraph::Node* u3 = graph.addNode(); in TEST_F()
184 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2); in TEST_F()
185 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F()
186 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F()
198 ListDigraph graph; in TEST_F() local
200 ListDigraph::Node* u1 = graph.addNode(); in TEST_F()
201 ListDigraph::Node* u2 = graph.addNode(); in TEST_F()
202 ListDigraph::Node* u3 = graph.addNode(); in TEST_F()
204 ListDigraph::Arc* a1 = graph.addArc(*u1, *u1); in TEST_F()
205 ListDigraph::Arc* a2 = graph.addArc(*u1, *u2); in TEST_F()
206 ListDigraph::Arc* a3 = graph.addArc(*u1, *u3); in TEST_F()
218 ListDigraph graph; in TEST_F() local
220 ListDigraph::Node* u1 = graph.addNode(); in TEST_F()
221 ListDigraph::Node* u2 = graph.addNode(); in TEST_F()
222 ListDigraph::Node* u3 = graph.addNode(); in TEST_F()
224 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2); in TEST_F()
225 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F()
226 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F()
228 graph.erase(*a2); in TEST_F()
244 ListDigraph graph; in TEST_F() local
246 ListDigraph::Node* u1 = graph.addNode(); in TEST_F()
247 ListDigraph::Node* u2 = graph.addNode(); in TEST_F()
248 ListDigraph::Node* u3 = graph.addNode(); in TEST_F()
250 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2); in TEST_F()
251 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F()
252 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F()
254 graph.erase(*a1); in TEST_F()
270 ListDigraph graph; in TEST_F() local
272 ListDigraph::Node* u1 = graph.addNode(); in TEST_F()
273 ListDigraph::Node* u2 = graph.addNode(); in TEST_F()
274 ListDigraph::Node* u3 = graph.addNode(); in TEST_F()
276 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2); in TEST_F()
277 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F()
278 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F()
280 graph.erase(*a3); in TEST_F()
296 ListDigraph graph; in TEST_F() local
298 ListDigraph::Node* u1 = graph.addNode(); in TEST_F()
299 ListDigraph::Node* u2 = graph.addNode(); in TEST_F()
300 ListDigraph::Node* u3 = graph.addNode(); in TEST_F()
302 ListDigraph::Arc* a1 = graph.addArc(*u1, *u1); in TEST_F()
303 graph.addArc(*u1, *u2); in TEST_F()
304 graph.addArc(*u1, *u3); in TEST_F()
306 graph.erase(*u1); in TEST_F()
314 Digraph graph; in TEST_F() local
316 Digraph::Node node = graph.addNode(); in TEST_F()
317 graph.addNode(); in TEST_F()
318 graph.addNode(); in TEST_F()
319 graph.addNode(); in TEST_F()
321 ASSERT_EQ(4, graph.numOfNodes()); in TEST_F()
322 ASSERT_EQ(0, graph.numOfArcs()); in TEST_F()