Chevron Left
Back to Graph Search, Shortest Paths, and Data Structures

Learner Reviews & Feedback for Graph Search, Shortest Paths, and Data Structures by Stanford University

4.8
stars
1,764 ratings
208 reviews

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.

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:

201 - 204 of 204 Reviews for Graph Search, Shortest Paths, and Data Structures

By Tianyi Z

Jul 16, 2018

The first programming assignment is just too bad.

By Prasanna M R

Apr 5, 2017

good in depth knowedge.

By Aditya A

Jul 29, 2020

the audio is not in sync with the video.