equal
deleted
inserted
replaced
804 this->graph->aNode(e.out)); } |
804 this->graph->aNode(e.out)); } |
805 Node bNode(InEdgeIt e) const { |
805 Node bNode(InEdgeIt e) const { |
806 return ((!e.backward) ? this->graph->bNode(e.in) : |
806 return ((!e.backward) ? this->graph->bNode(e.in) : |
807 this->graph->bNode(e.out)); } |
807 this->graph->bNode(e.out)); } |
808 |
808 |
|
809 /// Gives back the opposite edge. |
|
810 Edge opposite(const Edge& e) const { |
|
811 Edge f=e; |
|
812 f.backward=!f.backward; |
|
813 return f; |
|
814 } |
|
815 |
809 // int nodeNum() const { return graph->nodeNum(); } |
816 // int nodeNum() const { return graph->nodeNum(); } |
810 //FIXME |
817 //FIXME |
811 void edgeNum() const { } |
818 void edgeNum() const { } |
812 //int edgeNum() const { return graph->edgeNum(); } |
819 //int edgeNum() const { return graph->edgeNum(); } |
813 |
820 |