Sign inSign in

Transitive closure

The reachability relation between vertices in a graph, computed via repeated squaring or specialised matrix operations.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Undergraduate

    A problem that determines whether there is any path from vertex i to vertex j in a graph, returning 1 if a path exists and 0 otherwise.
    • 46:33Dynamic Programming: All-Pairs Shortest Paths

Lectures that assume it

2

Connections

9

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

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