1.1 --- a/src/lemon/concept/path.h	Sat Nov 13 12:24:01 2004 +0000
     1.2 +++ b/src/lemon/concept/path.h	Sat Nov 13 12:53:28 2004 +0000
     1.3 @@ -66,12 +66,12 @@
     1.4        ///
     1.5        /// Starting point of the path.
     1.6        /// Returns INVALID if the path is empty.
     1.7 -      GraphNode/*It*/ head() const {return INVALID;}
     1.8 +      GraphNode/*It*/ target() const {return INVALID;}
     1.9        /// \brief End point of the path.
    1.10        ///
    1.11        /// End point of the path.
    1.12        /// Returns INVALID if the path is empty.
    1.13 -      GraphNode/*It*/ tail() const {return INVALID;}
    1.14 +      GraphNode/*It*/ source() const {return INVALID;}
    1.15  
    1.16        /// \brief First NodeIt/EdgeIt.
    1.17        ///
    1.18 @@ -80,17 +80,17 @@
    1.19        template<typename It>
    1.20        It& first(It &i) const { return i=It(*this); }
    1.21  
    1.22 -      /// \brief The head of an edge.
    1.23 +      /// \brief The target of an edge.
    1.24        ///
    1.25 -      /// Returns node iterator pointing to the head node of the
    1.26 +      /// Returns node iterator pointing to the target node of the
    1.27        /// given edge iterator.
    1.28 -      NodeIt head(const EdgeIt& e) const {return INVALID;}
    1.29 +      NodeIt target(const EdgeIt& e) const {return INVALID;}
    1.30  
    1.31 -      /// \brief The tail of an edge.
    1.32 +      /// \brief The source of an edge.
    1.33        ///
    1.34 -      /// Returns node iterator pointing to the tail node of the
    1.35 +      /// Returns node iterator pointing to the source node of the
    1.36        /// given edge iterator.
    1.37 -      NodeIt tail(const EdgeIt& e) const {return INVALID;}
    1.38 +      NodeIt source(const EdgeIt& e) const {return INVALID;}
    1.39  
    1.40  
    1.41        /* Iterator classes */