| Copyright | (C) Frank Staals |
|---|---|
| License | see the LICENSE file |
| Maintainer | Frank Staals |
| Safe Haskell | None |
| Language | Haskell2010 |
Algorithms.Geometry.EuclideanMST.EuclideanMST
Description
Deprecated: This module will be deleted after 2021-06-01. Use Algorithms.Geometry.EuclideanMST instead.
\(O(n\log n)\) time algorithm algorithm to compute the Euclidean minimum spanning tree of a set of \(n\) points in \(\mathbb{R}^2\).