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:

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

By Vladimir M

Jan 2, 2021

By Linh T

Dec 9, 2019

By Neil S

Jun 28, 2019

By Qinghua Z

Aug 30, 2017

By Stacy I

Jun 1, 2019

By Mikhail K

Nov 27, 2018

By Johnathan F

Jan 14, 2018

By Grigory G

Nov 26, 2017

By NoneLand

Apr 18, 2018

By Neeladree C

Jun 30, 2017

By Dilyan M

Dec 16, 2017

By Garrett S

Dec 15, 2018

By Anway A

Jul 9, 2020

By Turker C

Jul 6, 2020

By navin m

Nov 29, 2020

By Fernando L C

Apr 16, 2018

By Krish R

May 16, 2018

By Arjun B

Jul 31, 2020

By Nicolae S A

Dec 14, 2016

By Alexey D

Nov 29, 2016

By Brande G

Jul 3, 2018

By Kalema A B

Nov 28, 2020

By Johan B

Sep 3, 2017

By Vishwas S

Jun 22, 2020

By Jianhui S

Oct 21, 2018