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,990 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

MB

Jun 8, 2021

T​hanks a lot to Prof Roughgarden for great lectures, to course mentors and fellow students for fruitful discussions. It was a hard, but insanely informative course.

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.

Filter by:

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

By Pruthvi K

May 28, 2022

Amazing course

By AKLI J E Y

Jun 11, 2021

Amazing course

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

brilliant!

By monkfish

Jun 24, 2018

great fun!

By Pavan P G K M

Jul 12, 2023

excellent

By Madhurya m

Sep 13, 2019

Great job

By Clayton W

Feb 2, 2019

excellent

By Felice F

Aug 31, 2020

Loved it

By Neo

May 13, 2019

Awesome!

By goldkeytom

Jan 2, 2018

excelent

By ryan

Sep 25, 2017

Awesome!

By Yisheng Y

Dec 1, 2016

Awesome!

By Ahmad D

Nov 8, 2020

🔥🔥🔥

By Jingyuan W

Nov 13, 2019

Great!

By dynasty919

Feb 20, 2018

nice!

By Shama M

Jul 28, 2024

good

By 최정식

Oct 3, 2021

.