Using the Swing GUI toolkit, this program implements Kruskal’s algorithm to calculate the minimum spanning tree (MST) of a graph.
-
Updated
Apr 24, 2020 - Java
Using the Swing GUI toolkit, this program implements Kruskal’s algorithm to calculate the minimum spanning tree (MST) of a graph.
Kruskal's algorithm finds a minimum spanning forest of an undirected edge-weighted graph. If the graph is connected, it finds a minimum spanning tree
Add a description, image, and links to the minimumspanningtree topic page so that developers can more easily learn about it.
To associate your repository with the minimumspanningtree topic, visit your repo's landing page and select "manage topics."