Bellman-Ford
← Back to Shortest Path
A shortest-path algorithm that handles graphs with negative edge weights. Relaxes all edges V-1 times and can detect negative-weight cycles. O(V * E) time, slower than Dijkstra but more general.
← Back to Shortest Path
A shortest-path algorithm that handles graphs with negative edge weights. Relaxes all edges V-1 times and can detect negative-weight cycles. O(V * E) time, slower than Dijkstra but more general.