1. You are given a graph, a src vertex and a destination vertex. 2. You are give a number named "criteria" and a number "k". 3. You are required to find and print the values of 3.1 Smallest path and it's weight separated by an "@" 3.2 Largest path and it's weight separated by an "@" 3.3 Just Larger path (than criteria in terms of weight) and it's weight separated by an "@" 3.4 Just smaller path (than criteria in terms of weight) and it's weight separated by an "@" 3.5 Kth largest path and it's weight separated by an "@"
Input Format
Input has been managed for you
Output Format
Check 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 6 30 4
Output
Smallest Path = 01256@28 Largest Path = 032546@66 Just Larger Path than 30 = 012546@36 Just Smaller Path than 30 = 01256@28 4th largest path = 03456@48