equal
deleted
inserted
replaced
147 /// \brief %BellmanFord algorithm class. |
147 /// \brief %BellmanFord algorithm class. |
148 /// |
148 /// |
149 /// \ingroup shortest_path |
149 /// \ingroup shortest_path |
150 /// This class provides an efficient implementation of the Bellman-Ford |
150 /// This class provides an efficient implementation of the Bellman-Ford |
151 /// algorithm. The maximum time complexity of the algorithm is |
151 /// algorithm. The maximum time complexity of the algorithm is |
152 /// <tt>O(ne)</tt>. |
152 /// <tt>O(nm)</tt>. |
153 /// |
153 /// |
154 /// The Bellman-Ford algorithm solves the single-source shortest path |
154 /// The Bellman-Ford algorithm solves the single-source shortest path |
155 /// problem when the arcs can have negative lengths, but the digraph |
155 /// problem when the arcs can have negative lengths, but the digraph |
156 /// should not contain directed cycles with negative total length. |
156 /// should not contain directed cycles with negative total length. |
157 /// If all arc costs are non-negative, consider to use the Dijkstra |
157 /// If all arc costs are non-negative, consider to use the Dijkstra |