prim's algorithm O(n^2)

implementing the O(n^2) version of Prim’s algorithm,

The input to your program is the cost matrix for a complete graph. The output is the

list of edges of a minimum spanning tree, where each edge is identified by its end

points, and the total cost of the minimum spanning tree. Your program should read

from the input file [login to view URL] and write to output file, output5.txt. The number of

vertices in the graph is at most 50.

Example input

0 2 3

2 0 5

3 5 0

Example output

The minimum spanning tree has total cost 5 and whose edges are

(1,2), (1,3)

No STL

Programim në gjuhën C++

ID Projekti: #22677200

Rreth projektit