- Due: xx/xx
- Up to two students may collaborate; please be prepared to discuss individual contributions
For this homework assignment you will do two programming assignments:
- Implement the Red Black Tree remove function
- Implement the A* Algorithm; given a graph, determine the path from start to finish
You should construct a simple dataset that validates your algorithm's correctness.
Implement a multithread version of the A* algorithm. Your program should run the A* in parallel.
- 5 completed correctly + enhancements
- 4 all requirements are met
- 3 all but a few requirements are met
- 2 significant number of requires are missing
- 0 not completed
Students will need to demonstrate their homework assignment in class.