Kruskal's algorithm for a minimum spanning tree
-
Updated
Mar 15, 2021 - TypeScript
Kruskal's algorithm for a minimum spanning tree
Thesis Project - The goal of this project was to create an algorithm visualization (AV) tool for students and faculty of CSUN to use, rather than using a whiteboard to draw complex graphs and diagrams. The algorithms I covered are Counting Inversions, Kruskal's Minimum/Maximum Spanning Tree, and Steiner Tree.
Minimum Spanning Tree Calculator
Add a description, image, and links to the kruskal-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the kruskal-algorithm topic, visit your repo's landing page and select "manage topics."