ConceptTheory & Algos
Prim's algorithm
A greedy algorithm that finds a minimum spanning tree for a weighted undirected graph by building the tree vertex by vertex from an arbitrary starting vertex.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.