Assignments
Intro questions
API, Datastructures (Extended Due Date: Jan 25)
Basic Graph (Due Jan 30)
Shortest Paths (Due Feb 7)
Java classes provided by Faisal that may help with the problems:
Graph.java Edge.java Node.java
A C++ sample implementation of Dijkstra
- J: Poor Timmy
- My C++ solution
- hint: Dijkstra grows the shortest path graph one node at a time. Once a node is picked off the priority queue,
it is never changed again. So, the path to that node must have been determined already
- K: Fill
- My C++ solution
- hint: this must be related to the current topic: shortest path. What is your graph?
- L: Audiophobia
- My C++ solution
- hint: Remember Friday and the discussion of MINIMAX, MAXIMIN?
Maximum Flow and Matching - Due Feb 26
Brute Force - Due Mar 6
Dynamic Programming - Due Mar 27
Number Theory - Due Apr 4