equal
deleted
inserted
replaced
899 /// It reverse the given edge. It simply negate the direction in the map. |
899 /// It reverse the given edge. It simply negate the direction in the map. |
900 void reverseEdge(const Edge& edge) { |
900 void reverseEdge(const Edge& edge) { |
901 direction->set(edge, !(*direction)[edge]); |
901 direction->set(edge, !(*direction)[edge]); |
902 } |
902 } |
903 |
903 |
904 /// \brief Returns the original direction in the undirected graph. |
|
905 /// |
|
906 /// Returns the original direction in the undirected graph. |
|
907 bool direction(const Edge& edge) const { |
|
908 return (*direction)[edge]; |
|
909 } |
|
910 |
|
911 void first(Node& i) const { graph->first(i); } |
904 void first(Node& i) const { graph->first(i); } |
912 void first(Edge& i) const { graph->first(i); } |
905 void first(Edge& i) const { graph->first(i); } |
913 void firstIn(Edge& i, const Node& n) const { |
906 void firstIn(Edge& i, const Node& n) const { |
914 bool d; |
907 bool d; |
915 graph->firstInc(i, d, n); |
908 graph->firstInc(i, d, n); |