Bellman Ford is another single source shortest path algorithm. We have discussed Dijkstra here in CommonLounge before.
The most important questions are:
1) What is special about Bellman Ford? When to use it and avoid Dijkstra?
2) Why don't we use Bellman Ford and forget about Dijkstra?
3) What are the most important applications of Bellman Ford other than just handling negative weight edges and checking negative cycles
This tutorial by Tushar Roy is a detailed one, explaining bellman ford and running a demo himself on the board.
This second tutorial is a shorter video tutorial by Algorithms With Attitude.
Text tutorials: The text tutorial on Brilliant is quite nice.
Exercise With Hints : UVA 11721 Instant View Of Big Bang