Sign inSign in

Invariant 2 for dynamic connectivity

The forests across different levels must nest such that F0⊆F1⊆⋯⊆Flog⁡nF_0 \subseteq F_1 \subseteq \dots \subseteq F_{\log n}, meaning FiF_i is simply the restriction of Flog⁡nF_{\log n} to the edges of GiG_i.
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.

Graph levels1Spanning forest1

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.