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,918 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:

26 - 50 of 225 Reviews for Graph Search, Shortest Paths, and Data Structures

By Jithu K

Nov 27, 2021

By Constantinos F

Apr 30, 2017

By Long N

Jan 16, 2021

By YEH T P

Feb 26, 2018

By Nicolas T

Mar 28, 2019

By Anton B

Nov 30, 2018

By Sviatoslav S

Dec 31, 2016

By Akash K B

May 24, 2020

By Dinghan X

Dec 10, 2019

By Okhunjon K

Oct 31, 2021

By derek S

Mar 29, 2020

By Tarit G

Dec 1, 2019

By Shaun G

Aug 2, 2021

By Hanyu C

Nov 12, 2017

By Oleksandr S

Aug 4, 2019

By Axel U

Dec 11, 2020

By ahmed a

Apr 9, 2020

By Jephte E

Dec 27, 2019

By Karan S

Sep 1, 2018

By Mariia B

Jun 9, 2021

By Anthony C

Aug 2, 2020

By Cole F

Jan 21, 2018

By Keerthana S

Jul 12, 2018

By Genyu Z

Feb 9, 2019