Lines Matching defs:Edge
32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
40 class Edge
53 Edge(Node *dst, Node *src, Type kind);
54 ~Edge() { unlink(); }
67 Edge *next[2]; // next edge outgoing/incident from/to origin/target
68 Edge *prev[2];
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
95 inline Edge *getEdge() const { return e; }
96 inline Edge::Type getType() { return e ? e->getType() : Edge::UNKNOWN; }
99 Graph::Edge *e;
100 Graph::Edge *t;
111 void attach(Node *, Edge::Type);
134 Edge *in;
135 Edge *out;
221 if (ei.getType() != Edge::BACK)
