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
786 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 - 105 of 105 Reviews for Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

By Marko D

Mar 25, 2020

Course is short for the topic complexity

By Zihan H

May 3, 2018

diffcult

By Nguyễn K T

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.