by Stavros (3 Submissions)
Category: Miscellaneous
Difficulty: Intermediate
Date Added: Wed 3rd February 2021
Rating: 
(7 Votes)
Simple Implementation of Prim's Algorithm for computing a Minimum Spanning Tree (MST). The GUI is ideal for demonstration purposes.
The MST is useful for efficiently solving some network design problems. An example might be a cable TV company laying cable to a new neighborhood, wanting to minimize total cable length.
Download is only 5 KB.
VBcoders
