Many applications in different domains need to calculate the shortest-path between two points in a graph. This title describes this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road network routing, including the use of heuristics and precomputation techniques.