Sign inSign in

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.
Watch it explained

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.

Cut property1Graph representations1Minimum spanning tree1Priority queue1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1

    Connections

    4

    The lectures that define it or assume it, and the concepts next to it.

    Concepts3

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.