vercel[bot]
commented
4 months ago The latest updates on your projects. Learn more about Vercel for Git ↗︎
| Name | Status | Preview | Comments | Updated (UTC) |
|---|---|---|---|---|
| koji | ✅ Ready (Inspect) | Visit Preview | 💬 Add feedback | Jul 25, 2024 2:18am |
This is a bit of a rehash of the old
Balancedclustering algo but now utilizes the r-tree to make it super fast and doesn't bother with merging. The reason for bringing this back is it actually was great if you cared more about coverage than number of hops and it was relatively simple to implement.