Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
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).
Affiliate disclosure: Course Kingdom participates in affiliate programmes (including Udemy via the Cuelinks network). Some links on this page are affiliate links — if you click and enroll, we may earn a small commission at no extra cost to you. Learn more.

