Sign inSign in

Kruskal's algorithm

An algorithm for finding a minimum spanning tree by considering edges in increasing order of weight and adding them if they do not form a cycle.
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.

Connected components1Disjoint-set data structure1Graph theory1Minimum spanning tree1Union-Find data structure1

Lecturers

1

    Connections

    2

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

    Concept1

    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.