Bellman-Ford Algorithm
Bellman-Ford
The Bellman-Ford algorithm is an algorithm used to find the shortest paths from a single source node to all other nodes in a weighted graph, even when negative edge weights are present. It works by iteratively relaxing edges until no further improvement can be made, and can also detect if a negative cycle exists within the graph.
8 connections Built by Tim Jones