Cross Reference: /frameworks/compile/mclinker/unittests/GraphTest.cpp

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