equal
deleted
inserted
replaced
157 /// not contain cycles with negative sum of length. If we can assume |
157 /// not contain cycles with negative sum of length. If we can assume |
158 /// that all edge is non-negative in the graph then the dijkstra algorithm |
158 /// that all edge is non-negative in the graph then the dijkstra algorithm |
159 /// should be used from each node rather and if the graph is sparse and |
159 /// should be used from each node rather and if the graph is sparse and |
160 /// there are negative circles then the johnson algorithm. |
160 /// there are negative circles then the johnson algorithm. |
161 /// |
161 /// |
162 /// The complexity of this algorithm is O(n^3 + e). |
162 /// The complexity of this algorithm is \f$ O(n^3+e) \f$. |
163 /// |
163 /// |
164 /// The type of the length is determined by the |
164 /// The type of the length is determined by the |
165 /// \ref concept::ReadMap::Value "Value" of the length map. |
165 /// \ref concept::ReadMap::Value "Value" of the length map. |
166 /// |
166 /// |
167 /// \param _Graph The graph type the algorithm runs on. The default value |
167 /// \param _Graph The graph type the algorithm runs on. The default value |