src/lemon/concept/path.h
changeset 991 e619a466ca5d
parent 967 6563019430ba
child 1151 b217fc69f913
equal deleted inserted replaced
1:db7ce84b8b3a 2:071419405fb8
    64 
    64 
    65       /// \brief Starting point of the path.
    65       /// \brief Starting point of the path.
    66       ///
    66       ///
    67       /// Starting point of the path.
    67       /// Starting point of the path.
    68       /// Returns INVALID if the path is empty.
    68       /// Returns INVALID if the path is empty.
    69       GraphNode/*It*/ head() const {return INVALID;}
    69       GraphNode/*It*/ target() const {return INVALID;}
    70       /// \brief End point of the path.
    70       /// \brief End point of the path.
    71       ///
    71       ///
    72       /// End point of the path.
    72       /// End point of the path.
    73       /// Returns INVALID if the path is empty.
    73       /// Returns INVALID if the path is empty.
    74       GraphNode/*It*/ tail() const {return INVALID;}
    74       GraphNode/*It*/ source() const {return INVALID;}
    75 
    75 
    76       /// \brief First NodeIt/EdgeIt.
    76       /// \brief First NodeIt/EdgeIt.
    77       ///
    77       ///
    78       /// Initializes node or edge iterator to point to the first
    78       /// Initializes node or edge iterator to point to the first
    79       /// node or edge.
    79       /// node or edge.
    80       template<typename It>
    80       template<typename It>
    81       It& first(It &i) const { return i=It(*this); }
    81       It& first(It &i) const { return i=It(*this); }
    82 
    82 
    83       /// \brief The head of an edge.
    83       /// \brief The target of an edge.
    84       ///
    84       ///
    85       /// Returns node iterator pointing to the head node of the
    85       /// Returns node iterator pointing to the target node of the
    86       /// given edge iterator.
    86       /// given edge iterator.
    87       NodeIt head(const EdgeIt& e) const {return INVALID;}
    87       NodeIt target(const EdgeIt& e) const {return INVALID;}
    88 
    88 
    89       /// \brief The tail of an edge.
    89       /// \brief The source of an edge.
    90       ///
    90       ///
    91       /// Returns node iterator pointing to the tail node of the
    91       /// Returns node iterator pointing to the source node of the
    92       /// given edge iterator.
    92       /// given edge iterator.
    93       NodeIt tail(const EdgeIt& e) const {return INVALID;}
    93       NodeIt source(const EdgeIt& e) const {return INVALID;}
    94 
    94 
    95 
    95 
    96       /* Iterator classes */
    96       /* Iterator classes */
    97 
    97 
    98       /**
    98       /**