| MST is a simple Java application for calculating a minimum spanning tree from a undirected, weighted graph. The graph is read from a standard ASCII text file. There is a command line version and a version with a SWING GUI available. It now allows multiple file selection / loading and internationalization. English and Swedish translations are currently available. |