equal
deleted
inserted
replaced
153 /// problem when the edges can have negative length but the graph should |
153 /// problem when the edges can have negative length but the graph should |
154 /// not contain cycles with negative sum of length. If we can assume |
154 /// not contain cycles with negative sum of length. If we can assume |
155 /// that all edge is non-negative in the graph then the dijkstra algorithm |
155 /// that all edge is non-negative in the graph then the dijkstra algorithm |
156 /// should be used rather. |
156 /// should be used rather. |
157 /// |
157 /// |
158 /// The complexity of the algorithm is O(n * e). |
158 /// The maximal time complexity of the algorithm is \f$ O(ne) \f$. |
159 /// |
159 /// |
160 /// The type of the length is determined by the |
160 /// The type of the length is determined by the |
161 /// \ref concept::ReadMap::Value "Value" of the length map. |
161 /// \ref concept::ReadMap::Value "Value" of the length map. |
162 /// |
162 /// |
163 /// \param _Graph The graph type the algorithm runs on. The default value |
163 /// \param _Graph The graph type the algorithm runs on. The default value |