Used for single source shortest path

https://www.youtube.com/watch?v=obWXjtg0L64

Time Complexity : O ( |V| |E| )

number of iterations = number of vertices - 1

make a table with all the vertices and infinity as their initial distance.

then at every iteration.. go to each node and check for its outgoing edges and calculate their distance.