ConceptTheory & Algos
Hamiltonian path problem
The problem of determining if a directed graph contains a path from a start node to an end node 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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.