ConceptTheory & Algos
Transitive closure
The reachability relation between vertices in a graph, computed via repeated squaring or specialised matrix operations.
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
2Each in their own terms, from the easiest level.
Erik Demaine
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.
Lectures that assume it
2Connections
9The lectures that define it or assume it, and the concepts next to it.