minimum_spanning_tree_

property PLSCAN.minimum_spanning_tree_: ndarray[tuple[int, int], dtype[float64]]

The mutual reachability minimum spanning tree (or forest).

A float64 array of shape (n_edges, 3) with columns:

• 0 — parent point index

• 1 — child point index

• 2 — mutual reachability edge weight

Edges are sorted by distance in ascending order. When the input data forms multiple connected components (e.g. a sparse distance graph with disconnected subgraphs), the result is a spanning forest with fewer than n_samples - 1 edges.