1.1 --- a/lemon/concepts/path.h Wed Feb 07 18:07:10 2007 +0000
1.2 +++ b/lemon/concepts/path.h Sun Feb 11 16:34:51 2007 +0000
1.3 @@ -171,7 +171,7 @@
1.4 int l = p.length();
1.5 int e = p.empty();
1.6
1.7 - typename _Path::RevIt id, ii(INVALID), i(p);
1.8 + typename _Path::RevEdgeIt id, ii(INVALID), i(p);
1.9
1.10 ++i;
1.11 typename _Graph::Edge ed = i;
1.12 @@ -232,9 +232,9 @@
1.13 /// \brief Forward or reverse dumping
1.14 ///
1.15 /// If the RevPathTag is defined and true then reverse dumping
1.16 - /// is provided in the path proxy. In this case instead of the
1.17 - /// EdgeIt the RevIt iterator should be implemented in the
1.18 - /// proxy.
1.19 + /// is provided in the path dumper. In this case instead of the
1.20 + /// EdgeIt the RevEdgeIt iterator should be implemented in the
1.21 + /// dumper.
1.22 typedef False RevPathTag;
1.23
1.24 /// \brief Lemon style iterator for path edges
1.25 @@ -268,27 +268,27 @@
1.26 ///
1.27 /// This class is used to iterate on the edges of the paths in
1.28 /// reverse direction.
1.29 - class RevIt {
1.30 + class RevEdgeIt {
1.31 public:
1.32 /// Default constructor
1.33 - RevIt() {}
1.34 + RevEdgeIt() {}
1.35 /// Invalid constructor
1.36 - RevIt(Invalid) {}
1.37 + RevEdgeIt(Invalid) {}
1.38 /// Constructor for first edge
1.39 - RevIt(const PathDumper &) {}
1.40 + RevEdgeIt(const PathDumper &) {}
1.41
1.42 /// Conversion to Edge
1.43 operator Edge() const { return INVALID; }
1.44
1.45 /// Next edge
1.46 - RevIt& operator++() {return *this;}
1.47 + RevEdgeIt& operator++() {return *this;}
1.48
1.49 /// Comparison operator
1.50 - bool operator==(const RevIt&) const {return true;}
1.51 + bool operator==(const RevEdgeIt&) const {return true;}
1.52 /// Comparison operator
1.53 - bool operator!=(const RevIt&) const {return true;}
1.54 + bool operator!=(const RevEdgeIt&) const {return true;}
1.55 /// Comparison operator
1.56 - bool operator<(const RevIt&) const {return false;}
1.57 + bool operator<(const RevEdgeIt&) const {return false;}
1.58
1.59 };
1.60