# jstelben/StelbenMST

> A project I did in 2014 to compare Kruskal's algorithm and Prim's algorithm in finding the minimum spanning tree for graphs of varying size and sparsity.

- **Canonical URL**: https://githubrepo.cloud/repo/jstelben/StelbenMST
- **GitHub Repository**: https://github.com/jstelben/StelbenMST
- **Maintainer / Creator**: https://github.com/jstelben
- **Discovered On**: Oct 6, 2026

---
*Indexed by GitHubRepo (https://githubrepo.cloud). Real-time open-source discovery & telemetry.*