1.1 --- a/src/hugo/path.h	Tue Sep 14 10:29:47 2004 +0000
     1.2 +++ b/src/hugo/path.h	Tue Sep 14 17:41:40 2004 +0000
     1.3 @@ -125,18 +125,6 @@
     1.4        return i=EdgeIt(*this, n);
     1.5      }
     1.6  
     1.7 -    /// Checks validity of a node or edge iterator.
     1.8 -    template<typename It>
     1.9 -    static
    1.10 -    bool valid(const It &i) { return i.valid(); }
    1.11 -
    1.12 -    /// Steps the given node or edge iterator.
    1.13 -    template<typename It>
    1.14 -    static
    1.15 -    It& next(It &e) {
    1.16 -      return ++e;
    1.17 -    }
    1.18 -
    1.19      /// \brief Returns node iterator pointing to the head node of the
    1.20      /// given edge iterator.
    1.21      NodeIt head(const EdgeIt& e) const {
    1.22 @@ -160,8 +148,6 @@
    1.23       *
    1.24       * Of course it converts to Graph::Edge
    1.25       *
    1.26 -     * \todo Its interface differs from the standard edge iterator.
    1.27 -     * Yes, it shouldn't.
    1.28       */
    1.29      class EdgeIt {
    1.30        friend class DirPath;
    1.31 @@ -209,8 +195,6 @@
    1.32       *
    1.33       * Of course it converts to Graph::Node
    1.34       *
    1.35 -     * \todo Its interface differs from the standard node iterator.
    1.36 -     * Yes, it shouldn't.
    1.37       */
    1.38      class NodeIt {
    1.39        friend class DirPath;