Description: The basic idea of the prime algorithm. Empty spanning tree, take any a vertex joined spanning tree. those endpoints in the spanning tree, another edge endpoint is not in the spanning tree, select a right to the smallest edge to it and other endpoint added Spanning Tree 3 Repeat step 2 until all vertices are entered until the spanning tree, spanning tree at this time is the minimum spanning tr
To Search:
File list (Check if you may need any files):
MST.CPP
Download