Changeset 1754:4bf5ceb49023 in lemon0.x for lemon/floyd_warshall.h
 Timestamp:
 11/02/05 16:27:38 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2283
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/floyd_warshall.h
r1741 r1754 143 143 }; 144 144 145 /// \brief FloydWarshall algorithm class.145 /// \brief %FloydWarshall algorithm class. 146 146 /// 147 147 /// \ingroup flowalgs 148 /// This class provides an efficient implementation of \c Floyd Warshall148 /// This class provides an efficient implementation of \c FloydWarshall 149 149 /// algorithm. The edge lengths are passed to the algorithm using a 150 150 /// \ref concept::ReadMap "ReadMap", so it is easy to change it to any … … 153 153 /// The algorithm solves the shortest path problem for each pairs 154 154 /// of node when the edges can have negative length but the graph should 155 /// not contain c irclewith negative sum of length. If we can assume155 /// not contain cycles with negative sum of length. If we can assume 156 156 /// that all edge is nonnegative in the graph then the dijkstra algorithm 157 157 /// should be used from each node rather and if the graph is sparse and 158 /// there are negative circles then the joh son algorithm.158 /// there are negative circles then the johnson algorithm. 159 159 /// 160 160 /// The complexity of this algorithm is O(n^3 + e). … … 429 429 } 430 430 431 /// \brief Executes the algorithm and checks the negative c ircles.431 /// \brief Executes the algorithm and checks the negative cycles. 432 432 /// 433 433 /// This method runs the %FloydWarshall algorithm in order to compute 434 /// the shortest path to each node pairs. If there is a negative c ircle434 /// the shortest path to each node pairs. If there is a negative cycle 435 435 /// in the graph it gives back false. 436 436 /// The algorithm computes
Note: See TracChangeset
for help on using the changeset viewer.