6.006 | Fall 2011 | Undergraduate

Introduction to Algorithms

Lecture Videos

Lecture 13: Breadth-First Search (BFS)

Description: This lecture begins with a review of graphs and applications of graph search, discusses graph representations such as adjacency lists, and covers breadth-first search.

Instructor: Erik Demaine

Course Info

Learning Resource Types
Lecture Videos
Recitation Videos
Problem Sets with Solutions
Exams with Solutions
Programming Assignments with Examples
Lecture Notes