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

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.

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 225 Reviews for Graph Search, Shortest Paths, and Data Structures

By monkfish

Jun 24, 2018

By Madhurya m

Sep 13, 2019

By Clayton W

Feb 2, 2019

By Felice F

Aug 31, 2020

By Neo

May 13, 2019

By goldkeytom

Jan 2, 2018

By ryan

Sep 25, 2017

By Yisheng Y

Dec 1, 2016

By Ahmad e D

Nov 8, 2020

By Jingyuan W

Nov 13, 2019

By dynasty919

Feb 20, 2018

By 최정식

Oct 3, 2021

By Sergey T

May 30, 2020

By Christopher E

Sep 21, 2019

By Gonzalo G A E

Apr 21, 2020

By Sivaramakrishnan S

May 11, 2020

By Ahmad B E

Jun 2, 2017

By Li-Pu C

May 27, 2020

By Bianca D

Feb 23, 2019

By Jingxuan W

Aug 24, 2019

By Nikola G

Jul 25, 2018

By Marcus H

Oct 19, 2017

By Georgios K

Dec 29, 2019

By Sai R

Dec 11, 2016

By L H

Mar 2, 2021