Shortest Path: Single Source and All Pairs

I will be covering two types of path here. Lets' start! Single Source Shortest Path A single source problem is about finding a path between a given vertex (called source) to all other vertices in graph such that the total distance between them (sourc...