Lines Matching refs:graph
15 using namespace mcld::graph;
42 ListDigraph graph;
44 ListDigraph::Node* u1 = graph.addNode();
45 ListDigraph::Node* u2 = graph.addNode();
46 ListDigraph::Node* u3 = graph.addNode();
64 graph.getHead(head);
67 graph.erase(*u2);
84 graph.getHead(head);
90 ListDigraph graph;
92 ListDigraph::Node* u1 = graph.addNode();
93 ListDigraph::Node* u2 = graph.addNode();
94 ListDigraph::Node* u3 = graph.addNode();
112 graph.getHead(head);
115 graph.erase(*u1);
132 graph.getHead(head);
138 ListDigraph graph;
140 ListDigraph::Node* u1 = graph.addNode();
141 ListDigraph::Node* u2 = graph.addNode();
142 ListDigraph::Node* u3 = graph.addNode();
160 graph.getHead(head);
163 graph.erase(*u3);
180 graph.getHead(head);
187 ListDigraph graph;
189 ListDigraph::Node* u1 = graph.addNode();
190 ListDigraph::Node* u2 = graph.addNode();
191 ListDigraph::Node* u3 = graph.addNode();
193 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2);
194 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3);
195 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1);
208 ListDigraph graph;
210 ListDigraph::Node* u1 = graph.addNode();
211 ListDigraph::Node* u2 = graph.addNode();
212 ListDigraph::Node* u3 = graph.addNode();
214 ListDigraph::Arc* a1 = graph.addArc(*u1, *u1);
215 ListDigraph::Arc* a2 = graph.addArc(*u1, *u2);
216 ListDigraph::Arc* a3 = graph.addArc(*u1, *u3);
229 ListDigraph graph;
231 ListDigraph::Node* u1 = graph.addNode();
232 ListDigraph::Node* u2 = graph.addNode();
233 ListDigraph::Node* u3 = graph.addNode();
235 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2);
236 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3);
237 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1);
239 graph.erase(*a2);
257 ListDigraph graph;
259 ListDigraph::Node* u1 = graph.addNode();
260 ListDigraph::Node* u2 = graph.addNode();
261 ListDigraph::Node* u3 = graph.addNode();
263 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2);
264 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3);
265 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1);
267 graph.erase(*a1);
284 ListDigraph graph;
286 ListDigraph::Node* u1 = graph.addNode();
287 ListDigraph::Node* u2 = graph.addNode();
288 ListDigraph::Node* u3 = graph.addNode();
290 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2);
291 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3);
292 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1);
294 graph.erase(*a3);
311 ListDigraph graph;
313 ListDigraph::Node* u1 = graph.addNode();
314 ListDigraph::Node* u2 = graph.addNode();
315 ListDigraph::Node* u3 = graph.addNode();
317 ListDigraph::Arc* a1 = graph.addArc(*u1, *u1);
318 graph.addArc(*u1, *u2);
319 graph.addArc(*u1, *u3);
321 graph.erase(*u1);
331 Digraph graph;
333 Digraph::Node node = graph.addNode();
334 graph.addNode();
335 graph.addNode();
336 graph.addNode();
338 ASSERT_EQ(4, graph.numOfNodes());
339 ASSERT_EQ(0, graph.numOfArcs());
