Kruskal - Experiments with randomly generated graphs and Kruskal's algorithm
This program, adapted from computer science coursework in algorithms and algorithm analysis, includes a clean implementation of Kruskal's minimum spanning tree algorithm in modern, generic Java.
By default it runs Kruskal's algorithm on two randomly generated, connected graphs of a vertex size specified by the user, and prints the total weight of the minimum spanning tree that results. A random seed must also be provided.
Please feel free to send me pull requests, but this repository is made available to you for pedagogical purposes. Please contact me before you adapt or use any of the source code within for personal or commercial projects.