Chevron Left
Retour à Graph Search, Shortest Paths, and Data Structures

Graph Search, Shortest Paths, and Data Structures, Université de Stanford

1,023 notes
118 avis

À propos de ce cours

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)....

Meilleurs avis

par JA

Oct 16, 2018

Interesting problems and explanations. But mathematical analysis is going off of my mind. It has very good explanation. Not sure, whether I can carry forward that knowledge or not.

par HC

Nov 12, 2017

Focused on principles and motivations behind algorithms. You might forget an algorithm you learned, but you will definitely be able to come up with one quickly after this course.

Filtrer par :

115 avis

par Genyu Zhang

Feb 10, 2019

This course is well useful. It helps me understand much I'm curious about. Thanks for teacher. He is quite good and I can't wait to enroll the third course!

par amosnier

Feb 08, 2019





















par clayton wong

Feb 03, 2019


par Ning Ke

Jan 27, 2019

Super super cool explanation of the shortest path, minimum spanning tree, and all other algorithms!

par Garrett Swanburg

Dec 15, 2018

Love the course and the instructor. The projects are very interesting, though the first one took a lot of effort to keep from crashing.

par Anton Berezin

Nov 30, 2018

Awesome. Thought one improvement idea: when the questions are asked about some dataset shown in a picture it would be nice to retain the picture when the form is shown. Otherwise one need to rewind to recall the dataset.

par Mikhail Kanin

Nov 27, 2018

It is very interesting course that gives an opportunity to improve the fundamental knowledge and skills that are connected with programming.

par Yifeng Luo

Nov 24, 2018

More challenging than first course, very good for beginners. Specially useful for those not in CS major.


Nov 16, 2018

Tim Roughgarden is one of the best professors who explains the concepts really well. He goes down to the nitty gritty details to explain the proofs which help understanding the concepts deeply

par Joshua Sakwa

Nov 02, 2018

It's a good course, but doesn't offer as much breadth as the first course. If you've never seen these concepts at all, this is a great starting point. If you are looking for a refresher, you might find that this course doesn't cover all the topics you want to drill into.