PROGRAMMING:Floyd: the shortest path
Please abbreviate the program to realize the Floyd algorithm for finding the shortest path of the directed network. Because the location can be Tambo lake, tranquil building, etc., it is simplified to number here. It is required to be able to find out the shortest path and minimum distance between any two points (represented by number).
Note: 1) the maximum number of vertices should not exceed 100; 2) The upper limit of distance weight does not exceed 9998;
###Input format:
###Output format:
![ QQ picture 20201121203429. PNG] (~ / 526008a3-d09c-4a2c-a1cc-08adc4e50165. PNG)
###Input example:
The first line, two integers: VN and en (the number of vertices and edges in the figure).
Next is the VN edge information: start point, end point, weight (three numbers in one line, separated by spaces);
The last two lines are the numbers of two groups of start and end points to be queried (one query for each line, and the start and end points are separated by spaces).
```in
6 8
0 5 100
0 2 10
0 4 30
1 2 5
2 3 50
3 5 10
4 3 20
4 5 60
0 5
2 0
```
(3) three pieces of information: vertex number and edge number; Edge information; Two sets of vertex information to query)
###Output example:
The first two lines output two groups of query results: first, the path description from the start to the end, and then the distance, separated by a colon. If two points are not reachable, the output distance is - 1. The last line is the description of the maximum distance in the whole reachable distance (if there are multiple groups, enter the group in front of the position, note: the unreachable infinity is not included).
```out
0->4->3->5:60
2->0:-1
1->2->3->5:65
```
answer：If there is no answer, please comment
Note: 1) the maximum number of vertices should not exceed 100; 2) The upper limit of distance weight does not exceed 9998;
###Input format:
###Output format:
![ QQ picture 20201121203429. PNG] (~ / 526008a3-d09c-4a2c-a1cc-08adc4e50165. PNG)
###Input example:
The first line, two integers: VN and en (the number of vertices and edges in the figure).
Next is the VN edge information: start point, end point, weight (three numbers in one line, separated by spaces);
The last two lines are the numbers of two groups of start and end points to be queried (one query for each line, and the start and end points are separated by spaces).
```in
6 8
0 5 100
0 2 10
0 4 30
1 2 5
2 3 50
3 5 10
4 3 20
4 5 60
0 5
2 0
```
(3) three pieces of information: vertex number and edge number; Edge information; Two sets of vertex information to query)
###Output example:
The first two lines output two groups of query results: first, the path description from the start to the end, and then the distance, separated by a colon. If two points are not reachable, the output distance is - 1. The last line is the description of the maximum distance in the whole reachable distance (if there are multiple groups, enter the group in front of the position, note: the unreachable infinity is not included).
```out
0->4->3->5:60
2->0:-1
1->2->3->5:65
```
answer：If there is no answer, please comment