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:

1 - 25 of 225 Reviews for Graph Search, Shortest Paths, and Data Structures

By Divij S

Feb 23, 2018

By Krishna K

Jul 1, 2019

By Jayachandra B A

Oct 16, 2018

By Hoang N

Jul 30, 2017

By Chris S

Apr 13, 2018

By Shiv K

Jul 22, 2017

By Alexander L

Nov 11, 2019

By Victor C

May 28, 2017

By Mario R

Aug 7, 2019

By Danijel P

Jul 30, 2018

By Ovidiu F

Oct 16, 2021

By Ziyan H

Sep 4, 2017

By Anurag G

Jul 17, 2018

By Nikhil n

Jul 21, 2017

By Brian C

Mar 26, 2017

By Benoit P

Dec 29, 2016

By --

Apr 11, 2021

By Piyush S

Apr 13, 2018

By Jonathan M

May 6, 2020

By Hagen T

Mar 19, 2018

By Aria B

Apr 21, 2020

By Anthony J O

May 3, 2017

By Joshua S

Nov 2, 2018

By Damian C

Feb 17, 2018

By John W

Aug 13, 2017