equal
deleted
inserted
replaced
148 /// This class provides an efficient implementation of \c Floyd-Warshall |
148 /// This class provides an efficient implementation of \c Floyd-Warshall |
149 /// algorithm. The edge lengths are passed to the algorithm using a |
149 /// algorithm. The edge lengths are passed to the algorithm using a |
150 /// \ref concept::ReadMap "ReadMap", so it is easy to change it to any |
150 /// \ref concept::ReadMap "ReadMap", so it is easy to change it to any |
151 /// kind of length. |
151 /// kind of length. |
152 /// |
152 /// |
153 /// The algorithm solves the shortest path problem for each pairs |
153 /// The algorithm solves the shortest path problem for each pair |
154 /// of node when the edges can have negative length but the graph should |
154 /// of node when the edges can have negative length but the graph should |
155 /// not contain cycles with negative sum of length. If we can assume |
155 /// not contain cycles with negative sum of length. If we can assume |
156 /// that all edge is non-negative in the graph then the dijkstra algorithm |
156 /// that all edge is non-negative in the graph then the dijkstra algorithm |
157 /// should be used from each node rather and if the graph is sparse and |
157 /// should be used from each node rather and if the graph is sparse and |
158 /// there are negative circles then the johnson algorithm. |
158 /// there are negative circles then the johnson algorithm. |