ConceptTheory & Algos
Dynamic connectivity
The problem of maintaining a graph under edge insertions and deletions while supporting queries about whether two vertices are connected by a path.
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.
Data structure2Graph theory2Connected components1Euler-tour trees1Graph1Graph paths1Minimum spanning forest1Undirected graph1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Erik Demaine
Connections
7The lectures that define it or assume it, and the concepts next to it.