Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Wan Luo
January 10, 2026
13 hours (approximately)
Wan Luo's account is verified. Coursera certifies their successful completion of Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Skills you will gain
- Category: Data Structures
- Category: Graph Theory
- Category: Network Routing
- Category: Algorithms
- Category: Computational Thinking
- Category: Computer Science
- Category: Theoretical Computer Science
