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
827 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
MJ
Nov 30, 2019
Great course in general, got the chance to dive a little deeper into the world of computer science.
HP
May 5, 2020
learn a lot about algorithmic complexity class and lot's of such a beautiful algorithm. Thank you sir for sharing your knowledge with us.
Filter by: