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

4.8
stars
814 ratings

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

AA

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.

AS

Aug 22, 2018

This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking.

One of the best courses I did on Coursera.

Filter by:

101 - 109 of 109 Reviews for Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

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.

By PLN R

•

Jun 25, 2018

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

By soroush j

•

Feb 13, 2023

Well the course only got harder but still stellar explanation.

By Marko D

•

Mar 25, 2020

Course is short for the topic complexity

By Zihan H

•

May 3, 2018

diffcult

By Thành N K

•

Sep 15, 2019

so hard

By --

•

Apr 27, 2021

Sometimes is really hard to understand, I wish more examples and visualization rather than straightforward speech.

By Xiao Z

•

Aug 17, 2019

Can be expanded more. Some of the quizzes are too hard.