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

1,962 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


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.


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:

176 - 200 of 236 Reviews for Graph Search, Shortest Paths, and Data Structures

By Haixu L

Jun 7, 2020

Learned a lot!

By 秦天

Jun 12, 2019

amazing course

By Karim E

Jan 15, 2018

Awesome course

By Ajit B

Aug 31, 2020

Great course!

By Rishabh K

Jan 11, 2018

just awesome!

By Stephen R

Jul 6, 2022

Very helpful

By Ryan S

Jun 28, 2017

Great course

By Saurav M

Mar 22, 2019

NIce course

By Maxim M

Dec 8, 2019


By monkfish

Jun 24, 2018

great fun!

By Pavan P G K M

Jul 12, 2023


By Madhurya m

Sep 13, 2019

Great job

By Clayton W

Feb 2, 2019


By Felice F

Aug 31, 2020

Loved it

By Neo

May 13, 2019


By goldkeytom

Jan 2, 2018


By ryan

Sep 25, 2017


By Yisheng Y

Dec 1, 2016


By Ahmad D

Nov 8, 2020


By Jingyuan W

Nov 13, 2019


By Vatsal S

Apr 29, 2023


By dynasty919

Feb 20, 2018


By 최정식

Oct 3, 2021


By Sergey T

May 30, 2020

This course was useful to me, thanks. As usual, I liked lectures and programming assignments provided, except for week 4.

I didn't like week 4 materials. It was a huge disappointment to me when the theory about hashing appeared to be too 'theoretical' with absolutely no code at all. It's just some high concept maths and nothing more. It is a real disaster if you are a 'doer' because you'll probably get almost nothing from 4th-week lectures and will be ought to learn about hashing somewhere else. This comes to a question of whether you need to learn hash tables here (and pay your money) or not. So if you have never encountered hash tables in your life, you might want to learn it before you take this course. In that case, consider it as a requirement for your enrollment.

By Christopher E

Sep 21, 2019

The only reason this is not a 5-star review is because of the Week 4 programming assignment. The point of Week 4 is to demonstrate the usefulness of using a hash table when frequent look-ups are necessary. However, the constants inherent to the assignment problem make the suggested algorithm take anywhere from 30 min to hours. Meanwhile, there is another algorithm that can accomplish the task in mere seconds, but this is not apparent without scouring the message boards for help. I feel it would be better to either rethink the assignment to bring it more in line with the point of the teaching material, or deliver some instruction on the actually useful algorithm, which is fascinating in its own right.

Otherwise, this course is excellent as usual.