Back to Graph Search, Shortest Paths, and Data Structures
Learner Reviews & Feedback for Graph Search, Shortest Paths, and Data Structures by Stanford University
1,990 ratings
About the Course
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).
Top reviews
MB
Jun 8, 2021
Thanks a lot to Prof Roughgarden for great lectures, to course mentors and fellow students for fruitful discussions. It was a hard, but insanely informative course.
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.
Filter by: