Lines Matching defs:const
55 inline Node *getOrigin() const { return origin; }
56 inline Node *getTarget() const { return target; }
58 inline Type getType() const { return type; }
59 const char *typeStr() const;
89 virtual bool end() const { return !e; }
90 virtual void *get() const { return e; }
92 inline Node *getNode() const { assert(e); return d ?
94 inline Edge *getEdge() const { return e; }
114 inline EdgeIterator outgoing(bool reverse = false) const;
115 inline EdgeIterator incident(bool reverse = false) const;
117 inline Node *parent() const; // returns NULL if count(incident edges) != 1
119 bool reachableBy(const Node *node, const Node *term) const;
122 inline int getSequence() const;
124 inline int incidentCountFwd() const; // count of incident non-back edges
125 inline int incidentCount() const { return inCount; }
126 inline int outgoingCount() const { return outCount; }
128 Graph *getGraph() const { return graph; }
151 inline Node *getRoot() const { return root; }
153 inline unsigned int getSize() const { return size; }
169 int findLightestPathWeight(Node *, Node *, const std::vector<int>& weights);
185 Graph::Node *Graph::Node::parent() const
201 int Graph::Node::getSequence() const
206 Graph::EdgeIterator Graph::Node::outgoing(bool reverse) const
211 Graph::EdgeIterator Graph::Node::incident(bool reverse) const
216 int Graph::Node::incidentCountFwd() const