diff -r 53e7969a92eb -r c8a41699e613 src/lemon/iterable_graph_extender.h
--- a/src/lemon/iterable_graph_extender.h	Fri Dec 03 12:19:26 2004 +0000
+++ b/src/lemon/iterable_graph_extender.h	Mon Dec 06 00:30:44 2004 +0000
@@ -157,7 +157,7 @@
 
     };
 
-    class UndirIncEdgeIt : public UndirEdge { 
+    class IncEdgeIt : public UndirEdge { 
       const Graph* graph;
       bool forward;
       friend class IterableUndirGraphExtender;
@@ -165,30 +165,30 @@
       friend class UndirGraphExtender;
     public:
 
-      UndirIncEdgeIt() { }
+      IncEdgeIt() { }
 
-      UndirIncEdgeIt(Invalid i) : UndirEdge(i), forward(false) { }
+      IncEdgeIt(Invalid i) : UndirEdge(i), forward(false) { }
 
-      explicit UndirIncEdgeIt(const Graph& _graph, const Node &n)
+      explicit IncEdgeIt(const Graph& _graph, const Node &n)
 	: graph(&_graph)
       {
 	_graph._dirFirstOut(*this, n);
       }
 
       // FIXME: Do we need this type of constructor here?
-      // UndirIncEdgeIt(const Graph& _graph, const Edge& e) : 
+      // IncEdgeIt(const Graph& _graph, const Edge& e) : 
       //   UndirEdge(e), graph(&_graph), forward(_graph.forward(e)) { }
       // or
-      // UndirIncEdgeIt(const Graph& _graph, const Node& n,
+      // IncEdgeIt(const Graph& _graph, const Node& n,
       //    Const UndirEdge &e) ... ?
 
-      UndirIncEdgeIt& operator++() {
+      IncEdgeIt& operator++() {
 	graph->_dirNextOut(*this);
 	return *this; 
       }
     };
 
-    Node source(const UndirIncEdgeIt &e) const {
+    Node source(const IncEdgeIt &e) const {
       return _dirSource(e);
     }
 
@@ -197,7 +197,7 @@
     using Parent::source;
 
     /// Target of the given Edge.
-    Node target(const UndirIncEdgeIt &e) const {
+    Node target(const IncEdgeIt &e) const {
       return _dirTarget(e);
     }