Video details loaded
HomeMIT 6.006 Introduction to Algorithms, Fall 2011Lecture 13: Breadth-First Search (BFS)

Lecture 13: Breadth-First Search (BFS)

50:48

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