What's New
Fixed clear screen button bug
About KruskalMinimumSpanningTree Android App
This application demonstrates Kruskal's method for finding the minimum spanning tree in a weighted undirected graph as described in the book "Algorithms" by Robert Sedgewick and Kevin Wayne. To add a vertex to the graph, tap on the screen. To add an edge to the graph, tap on the start vertex, then tap on the end vertex, then enter a value for the weight. To find the minimum spanning tree, tap on the "Minimum Spanning Tree" button. To clear the screen, tap on the "Clear" button.
Other Information:
Download
This version of KruskalMinimumSpanningTree Android App comes with one universal variant which will work on all the Android devices.
All Versions
If you are looking to download other versions of KruskalMinimumSpanningTree Android App, We have 1 version in our database. Please select one of them below to download.
