equal
deleted
inserted
replaced
181 /// This class provides an efficient implementation of \c %Johnson |
181 /// This class provides an efficient implementation of \c %Johnson |
182 /// algorithm. The edge lengths are passed to the algorithm using a |
182 /// algorithm. The edge lengths are passed to the algorithm using a |
183 /// \ref concept::ReadMap "ReadMap", so it is easy to change it to any |
183 /// \ref concept::ReadMap "ReadMap", so it is easy to change it to any |
184 /// kind of length. |
184 /// kind of length. |
185 /// |
185 /// |
186 /// The algorithm solves the shortest path problem for each pairs |
186 /// The algorithm solves the shortest path problem for each pair |
187 /// of node when the edges can have negative length but the graph should |
187 /// of node when the edges can have negative length but the graph should |
188 /// not contain cycles with negative sum of length. If we can assume |
188 /// not contain cycles with negative sum of length. If we can assume |
189 /// that all edge is non-negative in the graph then the dijkstra algorithm |
189 /// that all edge is non-negative in the graph then the dijkstra algorithm |
190 /// should be used from each node. |
190 /// should be used from each node. |
191 /// |
191 /// |