Oleksii Trekhleb | Javascript algorithms (Bellman – ford algorithm)
This is a series of books diving deep into the core mechanisms of the JavaScript language.
· 1 phút đọc.
The Bellman – Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra’s algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers.
Complexity
Worst-case performance O(|V||E|) Best-case performance O(|E|) Worst-case space complexity O(|V|)
Share:
