1. You are given a graph and a source vertex. The vertices represent cities and the edges represent
distance in kms.
2. You are required to find the shortest path to each city (in terms of kms) from the source city along
with the total distance on path from source to destinations.
Note -> For output, check the sample output and question video.Input Format
Input has been managed for you
Output Format
Check the sample output
Constraints
None
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
7 9 0 1 10 1 2 10 2 3 10 0 3 40 3 4 2 4 5 3 5 6 3 4 6 8 2 5 5 0
Output
0 via 0 @ 0 1 via 01 @ 10 2 via 012 @ 20 5 via 0125 @ 25 4 via 01254 @ 28 6 via 01256 @ 28 3 via 012543 @ 30