/KruskalMST

Computes the Minimum Spanning Tree of a graph using Kruska's algorithm

Primary LanguageJava

Computes the MST of a graph using Kruskal's Algorithm.

This folder contains the following
   
   1. Runnable .jar file of program
   2. Eclipse Project as .zip

********************
*   Runnable .jar  *
********************
1. Go to the Runnable_JAR directory. Example inputs are contained in the "inputs" directory.
2. To run the program, give the following command while in the directory:
	"java -jar Project3_schowel2.jar"
3. The program will prompt for input and output file names, run, and exit.

*****************************
*   Eclipse Project as .zip *
*****************************
The ZIP file Project3.zip is the entire Eclipse project containing the entire package hierarchy and all source code. May be used to check code or run inside the Eclipse GUI.