Single Source Shortest Path is the problem of finding the shortest path from a source vertex to all other vertices in a graph.