lemon/bellman_ford.h
changeset 800 28c7ad6f8d91
parent 781 6f10c6ec5a21
parent 786 e20173729589
child 804 4db8d5ccd26b
equal deleted inserted replaced
3:5d0f239d4f4d 5:5e20df85973b
   298     /// \brief \ref named-templ-param "Named parameter" for setting 
   298     /// \brief \ref named-templ-param "Named parameter" for setting 
   299     /// \c OperationTraits type.
   299     /// \c OperationTraits type.
   300     ///
   300     ///
   301     /// \ref named-templ-param "Named parameter" for setting
   301     /// \ref named-templ-param "Named parameter" for setting
   302     /// \c OperationTraits type.
   302     /// \c OperationTraits type.
   303     /// For more information see \ref BellmanFordDefaultOperationTraits.
   303     /// For more information, see \ref BellmanFordDefaultOperationTraits.
   304     template <class T>
   304     template <class T>
   305     struct SetOperationTraits
   305     struct SetOperationTraits
   306       : public BellmanFord< Digraph, LengthMap, SetOperationTraitsTraits<T> > {
   306       : public BellmanFord< Digraph, LengthMap, SetOperationTraitsTraits<T> > {
   307       typedef BellmanFord< Digraph, LengthMap, SetOperationTraitsTraits<T> >
   307       typedef BellmanFord< Digraph, LengthMap, SetOperationTraitsTraits<T> >
   308       Create;
   308       Create;
   716     /// tree for node \c v, i.e. it returns the last arc of a
   716     /// tree for node \c v, i.e. it returns the last arc of a
   717     /// shortest path from a root to \c v. It is \c INVALID if \c v
   717     /// shortest path from a root to \c v. It is \c INVALID if \c v
   718     /// is not reached from the root(s) or if \c v is a root.
   718     /// is not reached from the root(s) or if \c v is a root.
   719     ///
   719     ///
   720     /// The shortest path tree used here is equal to the shortest path
   720     /// The shortest path tree used here is equal to the shortest path
   721     /// tree used in \ref predNode() and \predMap().
   721     /// tree used in \ref predNode() and \ref predMap().
   722     ///
   722     ///
   723     /// \pre Either \ref run() or \ref init() must be called before
   723     /// \pre Either \ref run() or \ref init() must be called before
   724     /// using this function.
   724     /// using this function.
   725     Arc predArc(Node v) const { return (*_pred)[v]; }
   725     Arc predArc(Node v) const { return (*_pred)[v]; }
   726 
   726 
   731     /// tree for node \c v, i.e. it returns the last but one node of
   731     /// tree for node \c v, i.e. it returns the last but one node of
   732     /// a shortest path from a root to \c v. It is \c INVALID if \c v
   732     /// a shortest path from a root to \c v. It is \c INVALID if \c v
   733     /// is not reached from the root(s) or if \c v is a root.
   733     /// is not reached from the root(s) or if \c v is a root.
   734     ///
   734     ///
   735     /// The shortest path tree used here is equal to the shortest path
   735     /// The shortest path tree used here is equal to the shortest path
   736     /// tree used in \ref predArc() and \predMap().
   736     /// tree used in \ref predArc() and \ref predMap().
   737     ///
   737     ///
   738     /// \pre Either \ref run() or \ref init() must be called before
   738     /// \pre Either \ref run() or \ref init() must be called before
   739     /// using this function.
   739     /// using this function.
   740     Node predNode(Node v) const { 
   740     Node predNode(Node v) const { 
   741       return (*_pred)[v] == INVALID ? INVALID : _gr->source((*_pred)[v]); 
   741       return (*_pred)[v] == INVALID ? INVALID : _gr->source((*_pred)[v]);