Home | History | Annotate | Download | only in codegen

Lines Matching refs:Graph

31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
34 // A connected graph.
35 class Graph
72 friend class Graph;
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
99 Graph::Edge *e;
100 Graph::Edge *t;
129 Graph *getGraph() const { return graph; }
136 Graph *graph;
145 friend class Graph;
149 Graph();
150 ~Graph(); // does *not* free the nodes (make it an option ?)
163 // safe iterators are unaffected by changes to the *edges* of the graph
181 int Graph::nextSequence()
186 Graph::Node *Graph::Node::parent() const
194 bool Graph::Node::visit(int v)
202 int Graph::Node::getSequence() const
207 Graph::EdgeIterator Graph::Node::outgoing(bool reverse) const
212 Graph::EdgeIterator Graph::Node::incident(bool reverse) const
217 int Graph::Node::incidentCountFwd() const