Description: Draw a connected graph G(N, E), N = 31, E = 47
The weight of the edge is generated from the reading file in [0, 1]. 0 represents no connection to take a node as source/destination to build the shortest path tree.
Let's say source/destination is A[0,0]
Print the input matrix (N*N) and the shortest path (1*N) and print the shortest path sequence
To Search:
- [Led] - Show that the initial act of the first 0
File list (Check if you may need any files):
Download