Description: Construction of the commonly used minimum spanning tree algorithm is Prim and Kruskal algorithms, both are based on the design side of a little greedy algorithm.
- [greedyl] - Data structure and algorithm, greedy met
File list (Check if you may need any files):
PRIM.C
Download