263,573 views 884 on YTPak
0 0

Published on 22 Aug 2014 | over 2 years ago

Bellman-Ford algorithm is a very efficient single-source shortest path algorithm because it can also work for negative weighted graphs AND detect if a negative edge cycle exists or not. I hope this explanation is helpful enough and please subscribe and give a thumbs up! :)

Loading related videos...