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:

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

By Garrett M

May 22, 2018

By Songmao L

Nov 3, 2019

By Hao W

Mar 23, 2021

By Joseph B

Aug 9, 2018

By PLN R

Jun 17, 2018

By Marko D

Jan 15, 2020

By Manu A

Feb 9, 2020

By Rudransh J

May 4, 2020

By Fan Y

May 1, 2018

By Utsav S

Jul 27, 2020

By ALLA K R

Jan 15, 2020

By Sandeep P

Sep 8, 2018

By Toader A

Dec 6, 2020

By Mohit S

Jun 28, 2017

By Rakshit G

Dec 17, 2016

By Christophe K

Dec 29, 2020

By Nicolai V

Aug 21, 2022

By Sudhanshu B

Mar 4, 2020

By Michael B

Aug 7, 2017

By Joern K

Aug 30, 2018

By Nadanai L

Mar 30, 2019

By Tianyi Z

Jul 16, 2018

By Prasanna M R

Apr 5, 2017

By Aditya A

Jul 29, 2020