Lines Matching refs:graph
49 node->graph = this;
87 in(0), out(0), graph(0),
119 assert(graph || node->graph);
120 if (!node->graph)
121 graph->insert(node);
122 if (!graph)
123 node->graph->insert(this);
126 graph->classifyEdges();
143 // Cut a node from the graph, deleting all attached edges.
151 if (graph) {
152 if (graph->root == this)
153 graph->root = NULL;
154 graph = NULL;
173 const int seq = graph->nextSequence();
199 DFSIterator(Graph *graph, const bool preorder)
201 unsigned int seq = graph->nextSequence();
203 nodes = new Graph::Node * [graph->getSize() + 1];
206 nodes[graph->getSize()] = 0;
208 if (graph->getRoot()) {
209 graph->getRoot()->visit(seq);
210 search(graph->getRoot(), preorder, seq);
257 CFGIterator(Graph *graph)
259 nodes = new Graph::Node * [graph->getSize() + 1];
262 nodes[graph->getSize()] = 0;
264 // TODO: argh, use graph->sequence instead of tag and just raise it by > 1
265 for (IteratorRef it = graph->iteratorDFS(); !it->end(); it->next())
268 if (graph->getRoot())
269 search(graph->getRoot(), graph->nextSequence());
341 * We have a graph and want to classify the edges into one of four types:
342 * - TREE: edges that belong to a spanning tree of the graph