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:

76 - 100 of 225 Reviews for Graph Search, Shortest Paths, and Data Structures

By sysucx

Jan 24, 2017

By Yifeng L

Nov 23, 2018

By yangyunlong

Feb 7, 2020

By Ning K

Jan 26, 2019

By Rickard A

Jun 30, 2020

By Chaozhe H

Mar 4, 2021

By Владимир К

Nov 3, 2017

By Prince C S

Sep 9, 2021

By Feiyu L

Apr 25, 2018

By Hrithwik S

Apr 8, 2020

By liping l

May 29, 2017

By Muskan K

Feb 9, 2020

By josh c

May 28, 2020

By Peter C

Mar 19, 2018

By Alvaro J P F

Jan 23, 2017

By haifang z

Jan 3, 2017

By Kevin H

Oct 29, 2020

By Chi M

Sep 17, 2018

By vacous

Dec 29, 2017

By badrinath r

Nov 21, 2017

By Peregrine D

Nov 14, 2019

By Minyue D

May 24, 2017

By shivaranjani g

Jun 17, 2021

By David D

Aug 24, 2020

By Aishwarya R

Jul 17, 2019