Module minimum_spanning_tree 

Minimum spanning tree algorithms for sparse graphs

This module provides efficient implementations of minimum spanning tree (MST) algorithms for sparse matrices representing weighted graphs.

Enums

MSTAlgorithm

MST algorithm types

Functions

all_minimum_spanning_trees

Find all minimum spanning trees of a graph

is_spanning_tree

Check if a tree is a valid spanning tree of a graph

kruskal_mst

Kruskal’s algorithm for MST

minimum_spanning_tree

Compute the minimum spanning tree of a graph

prim_mst

Prim’s algorithm for MST

spanning_tree_weight

Compute the weight of a spanning tree