PROGRAMMING:Find the shortest path from one vertex to other vertices
This problem requires the calculation of a vertex v0 to other vertices of the shortest path, and output the path
###Input format:
The input is the vertex weight, and 0 is the end of the input
###Output format:
The output is the shortest path length and path from v0 to other vertices
###Input example:
Here is a set of inputs. For example:
```in
0 1 5
0 2 30
0 3 35
1 2 24
1 5 10
1 4 29
2 5 17
3 0 15
4 5 25
5 4 12
5 3 8
0 0 0
```
###Output example:
```out
0->1:5
0->1
0->2:29
0->1->2
0->3:23
0->1->5->3
0->4:27
0->1->5->4
0->5:15
0->1->5
```
answer:If there is no answer, please comment
###Input format:
The input is the vertex weight, and 0 is the end of the input
###Output format:
The output is the shortest path length and path from v0 to other vertices
###Input example:
Here is a set of inputs. For example:
```in
0 1 5
0 2 30
0 3 35
1 2 24
1 5 10
1 4 29
2 5 17
3 0 15
4 5 25
5 4 12
5 3 8
0 0 0
```
###Output example:
```out
0->1:5
0->1
0->2:29
0->1->2
0->3:23
0->1->5->3
0->4:27
0->1->5->4
0->5:15
0->1->5
```
answer:If there is no answer, please comment