A simple graph library
Deadwood: Outlier Detection via Pruning Mutual Reachability Minimum Spanning Trees
Lumbermark: Resistant Clustering via Chopping Up Mutual Reachability Minimum Spanning Trees
Minimum spanning tree based manifold approximations.
Python implementation of the Yamada-Kataoka-Watanabe algorithm to find all minimum spanning trees in an undirected graph.
