lemon/concepts/bpgraph.h
changeset 1055 05b34170866b
parent 1028 4441b066368c
child 1087 dd1443e4a34c
equal deleted inserted replaced
4:6c1e3f9075be 5:1a928c79150a
   995       /// (i.e. the target node of the corresponding arc).
   995       /// (i.e. the target node of the corresponding arc).
   996       Node runningNode(OutArcIt) const { return INVALID; }
   996       Node runningNode(OutArcIt) const { return INVALID; }
   997 
   997 
   998       /// \brief The base node of the iterator.
   998       /// \brief The base node of the iterator.
   999       ///
   999       ///
  1000       /// Returns the base node of the given incomming arc iterator
  1000       /// Returns the base node of the given incoming arc iterator
  1001       /// (i.e. the target node of the corresponding arc).
  1001       /// (i.e. the target node of the corresponding arc).
  1002       Node baseNode(InArcIt) const { return INVALID; }
  1002       Node baseNode(InArcIt) const { return INVALID; }
  1003 
  1003 
  1004       /// \brief The running node of the iterator.
  1004       /// \brief The running node of the iterator.
  1005       ///
  1005       ///
  1006       /// Returns the running node of the given incomming arc iterator
  1006       /// Returns the running node of the given incoming arc iterator
  1007       /// (i.e. the source node of the corresponding arc).
  1007       /// (i.e. the source node of the corresponding arc).
  1008       Node runningNode(InArcIt) const { return INVALID; }
  1008       Node runningNode(InArcIt) const { return INVALID; }
  1009 
  1009 
  1010       template <typename _BpGraph>
  1010       template <typename _BpGraph>
  1011       struct Constraints {
  1011       struct Constraints {