Chevron Left
Back to Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

Learner Reviews & Feedback for Shortest Paths Revisited, NP-Complete Problems and What To Do About Them by Stanford University

762 ratings
104 reviews

About the Course

The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search)....

Top reviews


Feb 27, 2017

This challenging course improves understanding of algorithms and is intellectually stimulating. I learnt the theory behind algorithms and how they are applied to solve real world problems.


Aug 22, 2018

This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking.\n\nOne of the best courses I did on Coursera.

Filter by:

76 - 100 of 103 Reviews for Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

By 李培春

Jun 24, 2017

Challenge course! Good course!

By Samuel E

Mar 12, 2020

That was awesome, thank you!

By Haixu L

Dec 24, 2020

Great class. Learned a lot!

By Thomas S

Jan 25, 2018

Nice Lessons, nice Grades!

By Tsogtbayar N

Sep 10, 2017

Thanks for the instructor.

By Anton B

Jan 18, 2019

Tim, thank you very much!

By Sui X

Jun 11, 2019

wow, such an good course

By zhangdi

Dec 6, 2017


By Yu G

Feb 6, 2021


By Jianghua F

Jan 29, 2018

Insightful course!

By Minyue D

Jul 13, 2017

Awesone Course!!!!

By Ajit B

Sep 6, 2020

Terrific course!

By biswa

Nov 10, 2018

Great material!

By Dinghan X

Jun 5, 2020

Great Course

By Madhurya m

Sep 3, 2019

Great course

By dynasty919

Mar 14, 2018

tough course

By Zhiping L

Jul 4, 2020


By Reda M M G

Feb 18, 2022

Very Good

By Ahmad e D

Nov 12, 2020


By Sanket S

Jul 10, 2017


By Nikeshkin L E

Oct 1, 2020

The course is great, it both challenging and interesting. The only one thing that I was lacking is visualisation. A lot of information/parts of algorithms explanations/theorem proofs is passed verbally and considering not triviality of that information it's hard to perceive and understand that without proper visualisation (algorithms animation/schemes/diagrams etc.).

By Oleksandr S

Jan 13, 2021

Totally the course and specialization are awesome. In this course, the explanation sometimes wasn't enough for such complex problems. At least I understood where I hare a rather big lack of knowledge and need to get the new courses.


Jun 25, 2018

Great one for people with advanced understanding! Others will find it slightly hard to follow!

By Marko D

Mar 25, 2020

Course is short for the topic complexity

By Zihan H

May 3, 2018