equal
deleted
inserted
replaced
189 /// of node when the edges can have negative length but the graph should |
189 /// of node when the edges can have negative length but the graph should |
190 /// not contain cycles with negative sum of length. If we can assume |
190 /// not contain cycles with negative sum of length. If we can assume |
191 /// that all edge is non-negative in the graph then the dijkstra algorithm |
191 /// that all edge is non-negative in the graph then the dijkstra algorithm |
192 /// should be used from each node. |
192 /// should be used from each node. |
193 /// |
193 /// |
194 /// The complexity of this algorithm is $O(n^2 * log(n) + n * log(n) * e)$ or |
194 /// The complexity of this algorithm is \f$ O(n^2\log(n)+n\log(n)e) \f$ or |
195 /// with fibonacci heap O(n^2 * log(n) + n * e). Usually the fibonacci heap |
195 /// with fibonacci heap \f$ O(n^2\log(n)+ne) \f$. Usually the fibonacci heap |
196 /// implementation is slower than either binary heap implementation or the |
196 /// implementation is slower than either binary heap implementation or the |
197 /// Floyd-Warshall algorithm. |
197 /// Floyd-Warshall algorithm. |
198 /// |
198 /// |
199 /// The type of the length is determined by the |
199 /// The type of the length is determined by the |
200 /// \ref concept::ReadMap::Value "Value" of the length map. |
200 /// \ref concept::ReadMap::Value "Value" of the length map. |