Description: Calculating an undirected graph, starting from a point to the rest of the points and the minimum distance. Application of Dijkstra' s algorithm is complete. The input format is, first enter two numbers N and M, N is the number of vertices then enter the M rows of data, each row of data for the two vertices number and the distance between the vertices.
To Search:
File list (Check if you may need any files):
project2main.cpp
Download