Simplified version of a system that finds the fastest or shortest trip along a network of roads, is an instance of the single-source, positive-weighted, shortest-path problem. In other words, from one particular vertex (a “single source”), we’ll be finding the shortest path to another vertex where all of the edges have a “positive weight” (in our case, distance or speed) associated with them.