Sign inSign in

ST-PATH

The problem of determining whether there is a path from vertex S to vertex T in a given graph.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe 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.

Directed graph2Graph2Complexity classes1Directed path1Edge1Graph theory1Path1Vertices1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 40:48The Immerman-Szelepcsényi Theorem
    • 40:42Space Complexity
    • 44:20Savitch's Theorem and NL

Connections

9

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

Concepts5

Lectures4

1 lecturer. 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.