Lines Matching defs:const
73 const char *Graph::Edge::typeStr() const
169 Graph::Node::reachableBy(const Node *node, const Node *term) const
171 std::stack<const Node *> stack;
172 const Node *pos = NULL;
173 const int seq = graph->nextSequence();
199 DFSIterator(Graph *graph, const bool preorder)
220 void search(Graph::Node *node, const bool preorder, const int sequence)
233 virtual bool end() const { return pos >= count; }
235 virtual void *get() const { return nodes[pos]; }
278 virtual void *get() const { return nodes[pos]; }
279 virtual bool end() const { return pos >= count; }
284 void search(Graph::Node *node, const int sequence)
404 Graph::findLightestPathWeight(Node *a, Node *b, const std::vector<int> &weight)
408 const int seq = nextSequence();
412 const int p = path[c->tag] + weight[c->tag];