Determine a minimum spanning tree in a weighted connected graph.

gm-u4-t4-s1-d2

Interactive

Grow the cheapest connected network

manipulative

Kruskal-style MST on a weighted camp-site graph — add cheapest safe edges, reject cycles, and watch total cable minimise.

Open fullscreen →

Want a different take?

Already have one and want another angle on this point? Describe what students should notice. Requests are read and acted on.