Explore modules

Minimum Spanning Tree

Visualize Kruskal's algorithm finding the minimum spanning tree of an edge-weighted graph.

Free theory article

Visualize Kruskal's algorithm finding the minimum spanning tree of an edge-weighted graph.

Concept & interpretation

A Minimum Spanning Tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. In simpler terms, it's the cheapest way to connect all nodes in a network.

Read the full free theory article