Description: Input The input data more groups, each of the first line of the three integers T, S and D, expressed T path, and grass adjacent to the city home with S a, grass want to go where there is a D Then there are T lines, each line has three integers a, b, time, that a, b between cities by car is time minutes (1 = T+1 and then the first line of the S number, and the grass family that is connected city then the first line of D number of T+2, that grass to go places. Output Output ZJB can go to a favorite city of the shortest possible time, such as can not be reached, output-1.
To Search:
File list (Check if you may need any files):
code.c
Download