Bellman-Ford Shortest Path Algorithm Explained | With Example | Graph Theory
I explain the Bellman-Ford Shortest Path Algorithm with the help of an example.
This algorithm can be used to calculate the shortest distance between one node and every other node in a weighted graph. We are also going through an example with negative cycles.
Chapters
0:00 Introduction
0:25 Assigning Tentative Distance Values
1:10 Determining Number Of Iterations
1:32 Relaxing The Edges
8:00 Identifying the Shortest Path
8:44 Identifying Negative Cycles
If you want to learn more about algorithms, check out my Essential Algorithms playlist.
☕ Support my work by tipping on https://ko-fi.com/felixtechtips :)