- 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 Matt Davis
February 16, 2017
13 hours (approximately)
Matt Davis'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
