- Pseudocode
- Operations Research
- Computational Thinking
- Algorithms
- Data Structures
- Graph Theory
- Theoretical Computer Science
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by ASHER ANDRE DANIEL MCKOY
November 26, 2020
13 hours (approximately)
ASHER ANDRE DANIEL MCKOY'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
