6.006 Introduction to Algorithms (Spring 2020, MIT OCW): Problem Session 05 - Graph Radius, Graph Schematics, Breadth and Depth-First Searches

6.006 Introduction to Algorithms

6.006 Introduction to Algorithms (Spring 2020, MIT OCW). Instructors: Prof. Erik Demaine, Dr. Jason Ku, and Prof. Justin Solomon. This course is an introduction to mathematical modeling of computational problems, as well as common algorithms, algorithmic paradigms, and data structures used to solve these problems. It emphasizes the relationship between algorithms and programming and introduces basic performance measures and analysis techniques for these problems. (from ocw.mit.edu)

Problem Session 05 - Graph Radius, Graph Schematics, Breadth and Depth-First Searches

Instructor: Prof. Justin Solomon. Five example problems are worked. Topics include graph radius, graph schematics, full breadth-first search, and full depth-first search.

Go to the Course Home or watch other lectures:

Lecture 01 - Algorithms and Computation

Lecture 02 - Data Structures and Dynamic Arrays

Problem Session 01 - Asymptotic Behavior of Functions and Double-ended Sequence Operations

Lecture 03 - Sets and Sorting

Lecture 04 - Hashing

Problem Session 02 - Solving Recurrences and the Master Theorem

Lecture 05 - Linear Sorting

Problem Session 03 - Drawing Pictures of Hash Tables and Reductions from Set to Sequence

Lecture 06 - Binary Trees, Part 1

Lecture 07 - Binary Trees, Part 2

Problem Session 04 - Sequence Rotations, Drawing Sequence Trees, Binary Search