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:

101 - 125 of 225 Reviews for Graph Search, Shortest Paths, and Data Structures

By Frank J M

Sep 19, 2019

By Manoj K

Jun 17, 2020

By Albert P

Jul 13, 2022

By Jonathan H

May 19, 2018

By Trong N

Jul 28, 2017

By KengHwee

Aug 14, 2020

By Jayana G

Aug 9, 2021

By Anil K M

Dec 25, 2017

By Yiming Z

Jul 26, 2018

By Julius S

Jun 6, 2017

By Pratik P

Sep 1, 2019

By Tong L

Dec 16, 2017

By Kozlov V

Jun 26, 2020

By Jamie J S

Feb 3, 2017

By Shisheng Z

Apr 19, 2020

By Xiaohui X

Oct 7, 2019

By Ethan

Jul 27, 2020

By Yuxing C

Jan 1, 2020

By Yuanzhan W

May 8, 2019

By Ian E

May 7, 2017

By Minsub L

Nov 13, 2019

By Ankit A

Nov 8, 2016

By Sani M

Nov 24, 2019

By NG K H

Oct 13, 2017

By Alexey Z

Jan 27, 2020