This module offers a highly customizable implementation of Prim’s algorithm to find the minimum spanning tree of individual clusters. By design, the output is guaranteed to be sanitized (e.g, each cluster will retains its existing connectivity properties).
It relies on user-defined 🝰 Heuristics in order to build the tree, providing very high level of control.
Refine🝰 Heuristics in order to build the tree, providing very high level of control.
