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
782 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:

51 - 75 of 104 Reviews for Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

By Saurav M

Mar 23, 2019

By Golu K

Jun 1, 2022

By shivaranjani g

Jun 18, 2021

By Kevin H

Oct 29, 2020

By Carole P

Feb 9, 2020

By Hrithwik S

Apr 8, 2020

By bangchuan l

Jan 6, 2019

By Ronak S

Jul 24, 2017

By Harlan G

Sep 10, 2020

By 吳俊輝

Apr 1, 2021

By Aishwarya R

Aug 4, 2019

By Jonathan H

May 19, 2018

By Julius S

Jun 6, 2017

By Yinchu D

Mar 30, 2019

By Thao N

Dec 15, 2018

By da k

Apr 22, 2018

By Aluisio R F d S

Feb 10, 2018

By Yuanzhan W

May 19, 2019

By Yuxuan ( G

May 28, 2020

By Qiyue Z

Dec 2, 2017

By Anthony N

Sep 25, 2017

By LK Z

Dec 1, 2018

By Simeon M

Nov 24, 2018

By Dilyan M

Feb 6, 2019

By Steven B

Mar 3, 2017