Add famst crate: Fast Approximate Minimum Spanning Tree

Implementation of the FAMST algorithm from Almansoori & Telek (2025).

Features:
- Generic over data type T and distance function
- Uses NN-Descent for ANN graph construction
- Three-phase approach: ANN graph, component connection, edge refinement
- O(dn log n) time complexity, O(dn + kn) space complexity

Paper: https://arxiv.org/abs/2507.14261

Author: jorendorff

crates/famst/Cargo.toml

@@ -0,0 +1,12 @@
+[package]
+name = "famst"
+version = "0.1.0"
+edition = "2024"
+description = "Fast Approximate Minimum Spanning Tree (FAMST) algorithm"
+license = "MIT"
+
+[dependencies]
+rand = "0.8"
+
+[dev-dependencies]
+rand = "0.8"