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.
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.
Beam search1Bidirectional search1Bitvector visited array optimization1Bottom-up BFS1Breadth-first augmenting path1Breadth-first search (BFS) distance computation1Breadth-first search optimality1Breadth-first search space complexity1Breadth-first search time complexity1Diameter problem1Direction-optimizing breadth-first search1Edmonds-Karp algorithm1
Lecturers
6Each in their own terms, from the easiest level.
Pieter Abbeel
A search strategy where instead of taking the deepest node, we take the shallowest one first.Erik Demaine
An algorithm for traversing or searching tree or graph data structures in unweighted graphs taking time.Brian Yu
Always going to explore the shallowest node in the frontier.Julian Shun
An algorithm given a source vertex s that visits vertices in order of their distance from s.Victor Costan
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
A search algorithm that builds up a search tree level by level until a path to the goal is found.
Lectures that assume it
6Connections
23The lectures that define it or assume it, and the concepts next to it.