MST is a very simple Java application for calculating a minimum spanning tree from a weighted, undirected graph. The graph is read from a standard ASCII text file. One of the possible minimum spanning trees for the graph is then printed to the screen, along with the total weight of the tree.
