Find K shortest paths in a network, where,
K can be any integer greater than 0. If all possible paths are exhausted
before K is reached, the program should output "paths exhausted."
The path should be output in the order of length.
All paths should be loopless
## Deliverables
The first line gives the number of nodes in a graph which is 5
There are 5 nodes in the graph, i.e., node 1,2,3,4,5.
-From the second line onwards, each line has 4 numbers separated by comma.
-The first number is link ID, the second one the head node ID of a link, the third one is the tail node ID of a link, and the fourth one is the weight of the link.
for example the second line is
12,1,2,0
that's mean that the link id is "12" , node 1 connected to node 2 with cost of 0
input notepad file:
===============
5
12,1,2,0
13,1,3,1
14,1,4,3
24,2,4,2
25,2,5,0
34,3,4,0
35,3,5,2
45,4,5,0