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).
- 5 stars85.40%
- 4 stars12.80%
- 3 stars1.15%
- 2 stars0.51%
- 1 star0.12%
来自SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM的热门评论
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.
Great Pace - good examples - always going to the point - clear and providing good information.
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.
Great one for people with advanced understanding! Others will find it slightly hard to follow!