Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
by Coursera
Master advanced algorithms including Bellman-Ford, Floyd-Warshall, and NP-completeness with Stanford on Coursera. Ideal for aspiring algorithm designers.
Why this course
- Exceptional theoretical depth and clarity from Stanford faculty
- Covers rare topics like Johnson’s algorithm and advanced reductions
- Builds strong foundation for research and technical interviews
- Well-structured progression from shortest paths to NP-hardness
