Minimum Spanning Tree
Connect every vertex at the lowest total cost — Kruskal's sorted edges or Prim's growing tree.
This topic is part of Pro.
Free covers the C and Python courses, the first three DSA topics, the opening system design lessons and the beginner AI lessons, all with the full coach. Pro opens the rest of the library in the FollowtheDamnCode app.
What is in it
- 1Spanning trees and the cut propertyWhat a minimum spanning tree is, how it differs from shortest paths, and why greedy choices are safe. Pro
- 2Kruskal's algorithmSort the edges, take each one that joins two different components, and stop at V − 1 edges. Pro
- 3Prim's algorithmGrow one tree from a start vertex, always adding the cheapest edge to a vertex not yet in it. Pro