Welcome to the MST Java Help System

Welcome to MST Java! MST is a application for calculating a minimum spanning tree from a undirected, weighted graph. The program should be quite straightforward to use, but this help file will give some hints and tips on using the program.

Usage

The first thing you will see when you start the application is this window:

The large area in the middle is where all output will be placed.
The buttons at the top has the following functionality:
Load: Allows you to load a graph file and calculate the minimum spanning tree.
Save: Save the contents of the output window to a file.
Draw: Draw the LATEST minimum spanning tree that has been determined.
Clear: Clears the uotput area.
Quit: Quits the application.

There are also a few menus:
File/Load: Same as the load button.
File/Save: Same as the save button.
File/Clear: Same as the clear button.
File/Quit: Same as the quit button.

Help/About: Displays a dialog with some info about the application.
Help/Help: Displays this help.

File Format

The graph files are just ordinary ASCII text files. They are organized as follows:
1 2 3
The numbers represent the edges in the graph.
The first number (1) is the start vertex of the edge.
The second number (2) is the end vertex of the edge.
The last number (3) is the weight of the edge.
Each line in the text file should contain these three numbers, separated by a space. For more exapmles, see test.txt and tree.txt, which are included in the distrobution.

Contact

Send bug reports and general comments to:
markus.svensson@linux.nu