Visual Minimum Spanning Tree

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.