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
DS
Mar 29, 2020
Awesome course! Professor Roughgarden is fantastic. The material was appropriately challenging. Perfect amount of rigor. Only one minor squabble: the hash problem set is terribly misleading.
OK
Oct 30, 2021
The course was very interesting. As a person who struggles with problem-solving, I found this course very helpful because the professor's ideas are well explained. It makes me to learn more.
Filter by: