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