ConceptTheory & Algos
Hamiltonian path
A path in a directed graph that visits every node exactly once.
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
3Each in their own terms, from the easiest level.
Michael Sipser
A path in a directed graph that visits every vertex exactly once, used here to demonstrate NP-completeness through reduction from 3SAT.Ryan O'Donnell
The problem of determining whether a graph has a path from S to T that visits every vertex exactly once.Marten van Dijk
A path in which every vertex is used exactly once.
Connections
11The lectures that define it or assume it, and the concepts next to it.