Sign inSign in

Edge insertion in dynamic connectivity

Adding an edge involves updating incidence lists, setting its level to log⁡n\log n, and performing a tree insertion if its endpoints are disconnected.
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.

Euler-tour trees1Incidence lists1

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.