Breadth-First Search

Lec 17 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005 - Erik Demaine, MIT
Did this clip help you learn about Breadth-First Search ?
    Jump to a Concept:
  • Paths - 01:46
  • Shortest Path - 01:47
  • Shortest Path Weight - 04:54
  • Triangle Inequality - 14:19
  • Dijkstra's Algorithm - 26:29
  • Breadth-First Search - 01:19:58

Our Philosophy

TeachingTree is an open platform that lets anybody organize educational content. Our goal is for students to quickly access the exact clips they need in order to learn individual concepts. Everyone is encouraged to help by adding videos or tagging concepts. Read our about page for more info.

Talk To Us

If you have any suggestions for how to make the TeachingTree better, questions about how to use the site, or just want to chat, email and we'll get back to you. We're always happy to talk.