PROGRAMMING:Dijkstra of the shortest path

This topic requires that by reading in the edge information of the undirected net (omitting the information of each vertex, only using the vertex number to represent), construct the graph, and use Dijkstra algorithm to find the shortest path from the specified source point to other points.
###Input example:
The first line, two integers, the number of vertices VN and the number of edges en.
The next few lines are the information of related edges. The edges of undirected graph are symmetrical. Only half of the edges (from small number to large number, with space between them) are input. The last two lines each have an integer. The first one specifies the source point, and the second one specifies the end point of the query.
(note that there are 34 edges in the example, and only 17 edges are entered.)
```in
10 34
0 1 2
0 3 5
1 2 5
1 3 2
2 4 8
2 5 4
3 5 4
3 6 2
4 7 5
4 5 2
5 6 3
5 7 9
5 8 7
6 8 7
7 8 3
7 9 4
8 9 8
0
eight
```
###Output example:
Output the short path and cost from the source point to the specified end point in one line. Note: all symbols are in western language.
```out
0-->1-->3-->6-->8:13
```







answer：If there is no answer, please comment