Sign inSign in

Hamiltonian path

A path in a directed graph that visits every node exactly once.
as Michael Sipser defines itMITThe wording closest to all 4 definitions
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

3

Each in their own terms, from the easiest level.

  • Michael Sipser

    MIT · Undergraduate

    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

    Carnegie Mellon University · Undergraduate

    The problem of determining whether a graph has a path from S to T that visits every vertex exactly once.
    • 14:41The Complexity Class NP
  • Marten van Dijk

    MIT · Undergraduate

    A path in which every vertex is used exactly once.

Connections

11

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

Concepts7

Show 1 more

Lectures4

3 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.