Grokking Algorithms: An illustrated guide for programmers and other curious people

by Aditya Y. Bhargava

To calculate the shortest path in an unweighted graph, use breadth-first search. To calculate the shortest path in a weighted graph, use Dijkstra’s algorithm.