The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis).
Depth-First Search (DFS): The Basics
Loading...
Skills You'll Learn
Graphs, Data Structure, Algorithms, Hash Table
Reviews
4.8 (1,980 ratings)
- 5 stars86.11%
- 4 stars11.51%
- 3 stars1.71%
- 2 stars0.25%
- 1 star0.40%
TG
Nov 30, 2019
It was an awesome experience to learn from such a teacher. Now I have a much clear view of the graph algorithms. I have enjoyed this course. Thanks to Stanford for offering this course.
SG
Aug 1, 2021
Very well put together course. Problem sets are tricky; however, by the end of the course, you feel quite accomplished and comfortable dealing with graphs and basic data structures.
From the lesson
Week 1
Breadth-first and depth-first search; computing strong components; applications.
Taught By
Tim Roughgarden
Professor