Alpha-EMST
Algorithms ยท Java
Alpha-EMST is a Java command-line program I wrote that computes Alpha-Euclidean minimum spanning trees for 2D points, using a Prim's algorithm specialised for dense graphs and fully deterministic output.
- Course
- Data Structures and Algorithms
- Type
- Data & systems
Overview
Alpha-EMST computes a deterministic minimum spanning tree for 2D points with an alpha threshold. The implementation uses a specialized Prim's algorithm for dense graphs, Y-major sorting, deterministic tie-breaking and efficient memory usage.
What I did
Implemented a deterministic Java command-line system for Alpha-Euclidean minimum spanning trees.
- Java
- Graph algorithms
- Prim's algorithm
- CLI
Features
- Dense-graph Prim's algorithm
- Deterministic output and tie-breaking
- Threshold-aware edge selection
- Scalable command-line utility
Notes
- Prim's algorithm specialised for dense 2D point graphs
- Alpha-threshold edge filtering with deterministic tie-breaking
- Command-line interface for repeatable runs