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:

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

By Gaurav P

Jun 8, 2017

By Xizhu Z

Apr 2, 2020

By Asela I

Aug 4, 2018

By Manoj B

Jun 12, 2017

By Xian L

Oct 13, 2018

By Tushar S

Aug 15, 2017

By Dara

Jul 19, 2017

By Yu G

Jan 31, 2021

By Abhinav D

May 28, 2020

By Rafael E

Jun 23, 2018

By Nelson L W

Dec 21, 2016

By wuhanwen

Nov 20, 2019

By Chellas E

Dec 30, 2019

By Ishan B

Jun 28, 2019

By Zhida Z

Jul 29, 2017

By Chris T

Jun 1, 2020

By 李紹弘

Jul 4, 2018

By Shuxiao C

Feb 17, 2018

By Yuxuan ( G

May 19, 2020

By Sergey A

Jun 10, 2019

By Ali İ E

Mar 23, 2022

By Code A A

Feb 8, 2019

By Yue W

Sep 12, 2017

By Ravishankar J

Mar 5, 2017

By zhangdi

Dec 6, 2017