Sign inSign in
ConceptAI & ML

Graph search

A search algorithm modification that prevents expanding the same state more than once by maintaining a closed set.
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.

Graph theory basics1Tree search1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Undergraduate

    The process of exploring a graph to find paths or visit nodes.
    • 0:42Breadth-First Search (BFS)

Lectures that assume it

8

Connections

16

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

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