- Computational Thinking
- Algorithms
- Theoretical Computer Science
- Pseudocode
- Graph Theory
- Operations Research
- Data Structures
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Fedor Zhuravlev
December 1, 2024
13 hours (approximately)
Fedor Zhuravlev'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
