Sign inSign in
ConceptAI & ML

Depth-first search

A search strategy that explores as far as possible along each branch before backtracking.
as Pieter Abbeel defines itUC BerkeleyThe wording closest to all 6 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

5

Each in their own terms, from the easiest level.

  • Patrick Winston

    MIT · Undergraduate

    A search method where you barrel ahead in a single-minded way down one branch until you get stuck.
    • 35:50Constraints: Interpreting Line Drawings
    • 8:10Search: Depth-First, Hill Climbing, Beam Search
  • Brian Yu

    Harvard University · Undergraduate

    The search algorithm where we always explore the deepest node in the frontier.
    • 30:44Harvard CS50’s Artificial Intelligence with Python – Full University Course
  • Erik Demaine

    MIT · Undergraduate

    A graph traversal algorithm that explores as far as possible along each branch before backtracking.
    • 2:21Depth-First Search (DFS), Topological Sort
  • Victor Costan

    MIT · Undergraduate

    An algorithm that starts at a node and recursively visits the unvisited neighbors along each branch before backtracking.
    • 6:47Depth-First Search (DFS) (MIT 6.006, Recitation 14)

Lectures that assume it

7

Connections

23

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

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