Dijkstra's algorithm: find the shortest path in a graph HD

Find the shortest path between two nodes of a weighted graph using the Dijkstra's algorithm.