Robot Timmy has packages to deliver. Help Timmy find the shortest path he can use to travel to deliver his package.
Because he is a robot, Timmy the area he has to travel in as a series of numbered points (maximum 150), and aclculations of the distance between pairs of these points.
The inputs to the program are as follows:
The first line will contain a pair of integer values a & b, where a represents the number of the point Timmy will be leaving from and b represents the number of the point timmy will be travelling to.
The second line will contain the number of points N (N <= 150). Points are numbered 0 to N - 1.
The third line will contain the number of connections between these points E (E <= 2500)
All of the remaining E lines will contain three values, two points with indexes i&j and the distance k between them (These pairs of points can be travelled in both directions)
輸入
Several lines of figures
First line you should input two number a and b (0<=a<=b<=N)
Second line you should input a single number N (N<=150)
Third line you should input a single number E (E<=2500)
then there will be several lines to enter the distance between two points with the order of i, j, k (i<=j)
輸出
The shortest route and the total distance of this route