The Bellman Ford algorithm got famous for quickly solving the 'shortest path problem' on directed graphs. Particularly, it is useful in this case as oppose to an alogrithm like Djikstra's since it can ...