Undirected k-nearest-neighbor graph of points (ties included)
NearestNeighborGraph[{elem1, elem2, …}]
NearestNeighborGraph[{elem1, elem2, …}, k]
NearestNeighborGraph[{elem1, elem2, …}, {k, r}]
NearestNeighborGraph[{elem1, elem2, …}, {All, r}]
Table[NearestNeighborGraph[Range[10], k], {k, 1, 6}]
→ {Graph[<10>, <9>], Graph[<10>, <11>], Graph[<10>, <19>], Graph[<10>, <23>], Graph[<10>, <30>], Graph[<10>, <36>]}NearestNeighborGraph[Range[10]]
→ Graph[<10>, <9>]NearestNeighborGraph[Range[10], 2]
→ Graph[<10>, <11>]- DirectedEdges — default Automatic
- DistanceFunction — default Automatic
- WorkingPrecision — default Automatic