Changeset 835:c92296660262 in lemon for lemon/bellman_ford.h
 Timestamp:
 11/18/09 14:38:02 (15 years ago)
 Branch:
 default
 Parents:
 834:c2230649a493 (diff), 833:e20173729589 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.  Phase:
 public
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

lemon/bellman_ford.h
r833 r835 24 24 /// \brief BellmanFord algorithm. 25 25 26 #include <lemon/list_graph.h> 26 27 #include <lemon/bits/path_dump.h> 27 28 #include <lemon/core.h> … … 776 777 /// length if the algorithm has already found one. 777 778 /// Otherwise it gives back an empty path. 778 lemon::Path<Digraph> negativeCycle() {779 lemon::Path<Digraph> negativeCycle() const { 779 780 typename Digraph::template NodeMap<int> state(*_gr, 1); 780 781 lemon::Path<Digraph> cycle; 
lemon/bellman_ford.h
r828 r835 301 301 /// \ref namedtemplparam "Named parameter" for setting 302 302 /// \c OperationTraits type. 303 /// For more information see \ref BellmanFordDefaultOperationTraits.303 /// For more information, see \ref BellmanFordDefaultOperationTraits. 304 304 template <class T> 305 305 struct SetOperationTraits … … 719 719 /// 720 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 723 /// \pre Either \ref run() or \ref init() must be called before … … 734 734 /// 735 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 738 /// \pre Either \ref run() or \ref init() must be called before
Note: See TracChangeset
for help on using the changeset viewer.