Learner Reviews & Feedback for Graph Search, Shortest Paths, and Data Structures by Stanford University
About the Course
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 30, 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 31, 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.
226 - 238 of 238 Reviews for Graph Search, Shortest Paths, and Data Structures
By Toader A
•Dec 6, 2020
Mentor help is almost non-existent.
By Mohit S
•Jun 28, 2017
NICE CONTENT.
By Rakshit G
•Dec 17, 2016
Good learning
By Christophe K
•Dec 29, 2020
good
By Sudhanshu B
•Mar 4, 2020
I feel it is an ok course, however the assignments can be made better. The assignments in Alogorithms offered by princeton are more interesting and meaningful.
By Michael B
•Aug 7, 2017
Some of the problem sets were a little fiddly. Especially the last one, which was crushingly terrible if you tried to actual use the solution he told you to.
By Joern K
•Aug 30, 2018
Sometimes badly synchronized, there are also mistakes in the videos which haven't been corrected.
By Nadanai L
•Mar 30, 2019
Wonderful material but some issues with programming assignments which need updating
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.
By alaa s
•Dec 29, 2023
bad