diff -r 57c316cb868b -r 5365600a7a5c lemon/concepts/path.h
--- a/lemon/concepts/path.h	Wed Feb 07 18:07:10 2007 +0000
+++ b/lemon/concepts/path.h	Sun Feb 11 16:34:51 2007 +0000
@@ -171,7 +171,7 @@
           int l = p.length();
           int e = p.empty();
 
-          typename _Path::RevIt id, ii(INVALID), i(p);
+          typename _Path::RevEdgeIt id, ii(INVALID), i(p);
 
           ++i;
           typename _Graph::Edge ed = i;
@@ -232,9 +232,9 @@
       /// \brief Forward or reverse dumping
       ///
       /// If the RevPathTag is defined and true then reverse dumping
-      /// is provided in the path proxy. In this case instead of the
-      /// EdgeIt the RevIt iterator should be implemented in the
-      /// proxy.
+      /// is provided in the path dumper. In this case instead of the
+      /// EdgeIt the RevEdgeIt iterator should be implemented in the
+      /// dumper.
       typedef False RevPathTag;
 
       /// \brief Lemon style iterator for path edges
@@ -268,27 +268,27 @@
       ///
       /// This class is used to iterate on the edges of the paths in
       /// reverse direction.
-      class RevIt {
+      class RevEdgeIt {
       public:
 	/// Default constructor
-	RevIt() {}
+	RevEdgeIt() {}
 	/// Invalid constructor
-	RevIt(Invalid) {}
+	RevEdgeIt(Invalid) {}
 	/// Constructor for first edge
-	RevIt(const PathDumper &) {}
+	RevEdgeIt(const PathDumper &) {}
 
         /// Conversion to Edge
 	operator Edge() const { return INVALID; }
 
 	/// Next edge
-	RevIt& operator++() {return *this;}
+	RevEdgeIt& operator++() {return *this;}
 
 	/// Comparison operator
-	bool operator==(const RevIt&) const {return true;}
+	bool operator==(const RevEdgeIt&) const {return true;}
 	/// Comparison operator
-	bool operator!=(const RevIt&) const {return true;}
+	bool operator!=(const RevEdgeIt&) const {return true;}
  	/// Comparison operator
- 	bool operator<(const RevIt&) const {return false;}
+ 	bool operator<(const RevEdgeIt&) const {return false;}
 
       };