Sign inSign in

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.
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.

Data structure2Graph theory2Connected components1Euler-tour trees1Graph1Graph paths1Minimum spanning forest1Undirected graph1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Erik Demaine

    MIT · Graduate

    • 1:55Dynamic Graphs II

Connections

7

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

Concepts5

Lectures2

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.