Sign inSign in

Dynamic transitive closure

The problem of maintaining whether there is a directed path between two given vertices v and w under edge updates in a graph.
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.

Directed graph1Dynamic graph algorithms1Path connectivity1Transitive closure1

Lecturers

1

    Connections

    3

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

    Concepts2

    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.