Sign inSign in
ConceptAI & ML

Breadth-first search

An algorithm for traversing or searching tree or graph data structures that explores neighbor nodes first, before moving to the next level neighbors.
as Erik Demaine defines itMITThe wording closest to all 8 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

6

Each in their own terms, from the easiest level.

  • Pieter Abbeel

    UC Berkeley · Undergraduate

    A search strategy where instead of taking the deepest node, we take the shallowest one first.
    • 1:00:48Uninformed Search
    • 5:30Markov Decision Processes (MDPs) Part 2/2
  • Erik Demaine

    MIT · Undergraduate

    An algorithm for traversing or searching tree or graph data structures in unweighted graphs taking O(V+E)O(V+E) time.
    • 2:57Dynamic Programming: All-Pairs Shortest Paths
  • Brian Yu

    Harvard University · Undergraduate

    Always going to explore the shallowest node in the frontier.
    • 31:09Harvard CS50’s Artificial Intelligence with Python – Full University Course
  • Julian Shun

    MIT · Undergraduate

    An algorithm given a source vertex s that visits vertices in order of their distance from s.
  • Victor Costan

    MIT · Undergraduate

    An algorithm that explores a graph level by level, starting from a source node and visiting all its neighbors before moving to the next level.
  • Patrick Winston

    MIT · Undergraduate

    A search algorithm that builds up a search tree level by level until a path to the goal is found.
    • 11:00Search: Depth-First, Hill Climbing, Beam Search

Lectures that assume it

6

Connections

23

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

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