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