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).
3 trial videos available. Create an account to watch unlimited course videos.
Topological Sort
Skills You'll Learn
Graphs, Data Structure, Algorithms, Hash Table
Reviews
4.8 (1,988 ratings)
- 5 stars86.16%
- 4 stars11.46%
- 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.
JA
Oct 15, 2018
Interesting problems and explanations. But mathematical analysis is going off of my mind. It has very good explanation. Not sure, whether I can carry forward that knowledge or not.
From the lesson
Week 1
Breadth-first and depth-first search; computing strong components; applications.
Taught By
Tim Roughgarden
Professor