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 →

Request an applet

Describe the interactive you’d like — same inbox as applet feedback, tagged as a request for this syllabus id.