Data Structures and Algorithms · Graphs

Bellman-Ford algorithm

Finding shortest paths that still works when some edge weights are negative, at the cost of speed.

Also known as: negative weight shortest path, negative cycle detection.

Start a lesson on Bellman-Ford algorithm

Learn first

• Graph traversal (BFS and DFS): Visiting every reachable vertex, either level by level (BFS) or by diving deep first (DFS).

Related topics

• Dijkstra's algorithm: Finding the cheapest path from one vertex to all others when no edge weight is negative.