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).
About this Course
Skills you will gain
- 5 stars85.42%
- 4 stars12.78%
- 3 stars1.15%
- 2 stars0.51%
- 1 star0.12%
TOP REVIEWS FROM SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM
Great Pace - good examples - always going to the point - clear and providing good information.
Excellent course! The lectures provide clear and rigorous explanations, and the coding exercises are appropriately challenging.
Great one for people with advanced understanding! Others will find it slightly hard to follow!
Excellent course! Bravo to the teacher for the commitment provided in this course. Kind regards.
About the Algorithms Specialization
Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
More questions? Visit the Learner Help Center.