Dijkstra's algorithm essentially uses breadth first search with greedy approach to come up with the shortest distance between given two nodes. Here is a video that explains Dijkstra's algorithm with the help of examples and animations.