ContextQMD
Back to Developer Roadmap

Bellman Ford's Algorithm

src/data/roadmaps/computer-science/content/bellman-fords-algorithm@eY4nK2lPYsrR-a_8y2sao.md

4.0796 B
Original Source

Bellman Ford's Algorithm

Bellman ford's algorithm is a graph algorithm that finds the shortest path from a source vertex to all other vertices in a graph. It is a dynamic programming algorithm that uses a bottom-up approach to find the shortest path. It is similar to Dijkstra's algorithm but it can handle negative weights. It is also similar to Floyd-Warshall's algorithm but it can handle negative weights and it is faster than Floyd-Warshall's algorithm.

Visit the following resources to learn more: