 |
|
|
|
|
|
| MST is a very simple Java application for computing a
Minimum Spanning Tree from a undirected, weighted graph. MST is written
completely in Java, and thus should be 100% platform independent. I have
only tried it on Linux, Windows NT 4.0 and Windows XP with Sun's JDK 1.3
installed. MST is made available to the public under the terms of the
GNU General Public License. MST is currently at version 1.5. The program
now has a graphical user interface. The command line version is also
available for those of you who want's to use it. It will also be
maintained, if any changes are med to the main algorithms or similar are
made. |
 |
|
|
|
MST
