1.1 --- a/src/lemon/iterable_graph_extender.h Fri Dec 03 12:19:26 2004 +0000
1.2 +++ b/src/lemon/iterable_graph_extender.h Mon Dec 06 00:30:44 2004 +0000
1.3 @@ -157,7 +157,7 @@
1.4
1.5 };
1.6
1.7 - class UndirIncEdgeIt : public UndirEdge {
1.8 + class IncEdgeIt : public UndirEdge {
1.9 const Graph* graph;
1.10 bool forward;
1.11 friend class IterableUndirGraphExtender;
1.12 @@ -165,30 +165,30 @@
1.13 friend class UndirGraphExtender;
1.14 public:
1.15
1.16 - UndirIncEdgeIt() { }
1.17 + IncEdgeIt() { }
1.18
1.19 - UndirIncEdgeIt(Invalid i) : UndirEdge(i), forward(false) { }
1.20 + IncEdgeIt(Invalid i) : UndirEdge(i), forward(false) { }
1.21
1.22 - explicit UndirIncEdgeIt(const Graph& _graph, const Node &n)
1.23 + explicit IncEdgeIt(const Graph& _graph, const Node &n)
1.24 : graph(&_graph)
1.25 {
1.26 _graph._dirFirstOut(*this, n);
1.27 }
1.28
1.29 // FIXME: Do we need this type of constructor here?
1.30 - // UndirIncEdgeIt(const Graph& _graph, const Edge& e) :
1.31 + // IncEdgeIt(const Graph& _graph, const Edge& e) :
1.32 // UndirEdge(e), graph(&_graph), forward(_graph.forward(e)) { }
1.33 // or
1.34 - // UndirIncEdgeIt(const Graph& _graph, const Node& n,
1.35 + // IncEdgeIt(const Graph& _graph, const Node& n,
1.36 // Const UndirEdge &e) ... ?
1.37
1.38 - UndirIncEdgeIt& operator++() {
1.39 + IncEdgeIt& operator++() {
1.40 graph->_dirNextOut(*this);
1.41 return *this;
1.42 }
1.43 };
1.44
1.45 - Node source(const UndirIncEdgeIt &e) const {
1.46 + Node source(const IncEdgeIt &e) const {
1.47 return _dirSource(e);
1.48 }
1.49
1.50 @@ -197,7 +197,7 @@
1.51 using Parent::source;
1.52
1.53 /// Target of the given Edge.
1.54 - Node target(const UndirIncEdgeIt &e) const {
1.55 + Node target(const IncEdgeIt &e) const {
1.56 return _dirTarget(e);
1.57 }
1.58