equal
deleted
inserted
replaced
207 |
207 |
208 void clear() const { graph->clear(); } |
208 void clear() const { graph->clear(); } |
209 |
209 |
210 bool forward(const Edge& e) const { return graph->forward(e); } |
210 bool forward(const Edge& e) const { return graph->forward(e); } |
211 bool backward(const Edge& e) const { return graph->backward(e); } |
211 bool backward(const Edge& e) const { return graph->backward(e); } |
|
212 |
|
213 int id(const Node& v) const { return graph->id(v); } |
|
214 int id(const Edge& e) const { return graph->id(e); } |
212 |
215 |
213 Edge opposite(const Edge& e) const { return Edge(graph->opposite(e)); } |
216 Edge opposite(const Edge& e) const { return Edge(graph->opposite(e)); } |
214 |
217 |
215 template<typename T> class NodeMap : public Graph::template NodeMap<T> { |
218 template<typename T> class NodeMap : public Graph::template NodeMap<T> { |
216 typedef typename Graph::template NodeMap<T> Parent; |
219 typedef typename Graph::template NodeMap<T> Parent; |