Dijkstra's algorithm is an efficient shortest path algorithm for graph with weighted edges (weights are not allowed to be negative).
Video tutorial: Runs though the problem statement and shows the algorithm on a well chosen example. Also includes pseudocode.
As always, if you have doubts, feel free to ask. And please share additional resources you find.