Lines Matching defs:Node
31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
38 class Node;
53 Edge(Node *dst, Node *src, Type kind);
56 inline Node *getOrigin() const { return origin; }
57 inline Node *getTarget() const { return target; }
63 Node *origin;
64 Node *target;
93 inline Node *getNode() const { assert(e); return d ?
105 class Node
108 Node(void *);
109 ~Node() { cut(); }
111 void attach(Node *, Edge::Type);
112 bool detach(Node *);
118 inline Node *parent() const; // returns NULL if count(incident edges) != 1
120 bool reachableBy(const Node *node, const Node *term) const;
152 inline Node *getRoot() const { return root; }
158 void insert(Node *node); // attach to or set as root
169 // @weights: indexed by Node::tag
170 int findLightestPathWeight(Node *, Node *, const std::vector<int>& weights);
173 void classifyDFS(Node *, int&);
176 Node *root;
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