ConceptTheory & Algos
Minimum spanning tree algorithm
An algorithm that grows a subgraph one edge at a time, adding the minimum weight edge that keeps the subgraph acyclic.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.