lemon/concepts/digraph.h
changeset 1080 c5cd8960df74
parent 877 141f9c0db4a3
child 1086 97f1760dcd13
equal deleted inserted replaced
12:e27936e0bf81 13:7fbf1bd55ec0
   407       /// (i.e. the target node of the corresponding arc).
   407       /// (i.e. the target node of the corresponding arc).
   408       Node runningNode(OutArcIt) const { return INVALID; }
   408       Node runningNode(OutArcIt) const { return INVALID; }
   409 
   409 
   410       /// \brief The base node of the iterator.
   410       /// \brief The base node of the iterator.
   411       ///
   411       ///
   412       /// Returns the base node of the given incomming arc iterator
   412       /// Returns the base node of the given incoming arc iterator
   413       /// (i.e. the target node of the corresponding arc).
   413       /// (i.e. the target node of the corresponding arc).
   414       Node baseNode(InArcIt) const { return INVALID; }
   414       Node baseNode(InArcIt) const { return INVALID; }
   415 
   415 
   416       /// \brief The running node of the iterator.
   416       /// \brief The running node of the iterator.
   417       ///
   417       ///
   418       /// Returns the running node of the given incomming arc iterator
   418       /// Returns the running node of the given incoming arc iterator
   419       /// (i.e. the source node of the corresponding arc).
   419       /// (i.e. the source node of the corresponding arc).
   420       Node runningNode(InArcIt) const { return INVALID; }
   420       Node runningNode(InArcIt) const { return INVALID; }
   421 
   421 
   422       /// \brief Standard graph map type for the nodes.
   422       /// \brief Standard graph map type for the nodes.
   423       ///
   423       ///