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