short1.out

数据结构c++语言描述 Borland C++实现

enter number of edges of 5 vertex digraph
enter edge 1
enter edge 2
enter edge 3
enter edge 4
enter edge 5
enter edge 6
enter edge 7
The input graph is
0 4 2 0 8 
0 0 0 4 5 
0 0 0 1 0 
0 0 0 0 3 
0 0 0 0 0 
dist[i] and p[i] are
0 0
4 1
2 1
3 3
6 4
Shortest path from vertex 1 to vertex 1 is the reverse of 1
Shortest path from vertex 1 to vertex 2 is the reverse of 2 1
Shortest path from vertex 1 to vertex 3 is the reverse of 3 1
Shortest path from vertex 1 to vertex 4 is the reverse of 4 3 1
Shortest path from vertex 1 to vertex 5 is the reverse of 5 4 3 1