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.
|Operating Systems||OS Independent|
Release Notes: Functionality for viewing a graphical representation of the minimum spanning tree was added.
Release Notes: This release adds a popup (right mouse button) menu. Multiple file selection is now allowed when loading graphs. Internationalization support was added, with English and Swedish translations currently available.
Release Notes: It's now possible to save the contents of the output window. A minor bug in the help viewer and some small aesthetical issues with the GUI have been fixed.
Release Notes: New menus, a new quit button, an HTML help system, changing control from the GUI to a separate controller class, and JavaDoc comments in the code.
Release Notes: The application now uses a Swing graphical user interface, rather than the old command-line user interface.