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:

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

By Jerome Z

Oct 29, 2018

By Yifan Z

Feb 8, 2018

By Bogdan K

Jun 28, 2017

By Carlos W C Y

Apr 12, 2022

By Manol D

Feb 12, 2020

By Fesri H

Jan 2, 2020

By Ashish S

Aug 6, 2018

By Luiz C

Mar 19, 2018

By 20-IT-036 C S

Apr 30, 2022

By Sui X

Jun 5, 2019

By Bastin J

May 28, 2018

By Deleted A

Oct 15, 2017

By Khan M A

Jul 16, 2017

By luketerry

Jul 13, 2017

By Pruthvi K

May 28, 2022

By AKLI J E Y

Jun 11, 2021

By Haixu L

Jun 7, 2020

By 秦天

Jun 12, 2019

By Karim E

Jan 15, 2018

By Ajit B

Aug 31, 2020

By Rishabh K

Jan 11, 2018

By Stephen R

Jul 6, 2022

By Ryan S

Jun 28, 2017

By Saurav M

Mar 22, 2019

By Maxim M

Dec 8, 2019