A central problem in algorithmic graph theory is the shortest path problem. One of the generalizations of the shortest path problem is known as the single-source-shortest-paths problem, which consists of finding the shortest paths from a source vertex to all other vertices in the graph. From Wikipedia
