Description: Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.
File list (Check if you may need any files):
prims outpu.txt
Prims2.cpp
Download