Grokking Graph Algorithms for Coding Interviews
Ask Author
Back to course home

0% completed

Vote For New Content
Bellman–Ford Algorithm
On this page

The Bellman-Ford algorithm is a well-known algorithm for finding the shortest paths from a single source vertex to all other vertices in a weighted graph. Unlike Dijkstra's algorithm, Bellman-Ford can handle graphs with negative weight.

Key Features

  • Single Source Shortest Path: Finds the shortest path from a single source vertex to all other vertices in the graph.
  • Negative Weight Edges: Can handle graphs with negative weight edges, unlike Dijkstra's algorithm.

.....

.....

.....

Like the course? Get enrolled and start learning!

On this page