ConceptTheory & Algos
Minimum spanning tree growth lemma
A lemma stating that any set of edges selected so far by the algorithm can be extended into a complete minimum spanning tree.
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
3The lectures that define it or assume it, and the concepts next to it.