[SOLVED] graph Total marks: 80

Total marks: 80
COMP 8042 Instructor: Borna Noureddin Assignment #3
All work should be done individually.
Complete the implementation of the GetMinDegIndex()and TopologicalSort()
1. [15 marks]
functions in the Graph.h file to implement a topological sort on a graph, as covered in Chapter 9 of the textbook.
2. [25 marks] Modify the the CuckooHashTable class in the CuckooHashing.h file to implement a cuckoo hash, as described in Chapter 5 of the textbook.
3. [40 marks] Modify the the quadtree.h file to implement a QuadTree for collision. You will have to:
a. Implement the QuadTree constructor
b. Implement the Clear() method of the QuadTree class
c. Implement the Insert() method of the QuadTree class
d. Implement the Retrieve() method of the QuadTree class
e. Implement the Split() method of the QuadTree class
f. Implement the Update() method of the QuadtreeTest class
g. Implement the IsCollided() method of the QuadtreeTest class
Make sure to comment each change in your code clearly so it is easy to see what you have changed.
Submit the completed CuckooHashing.h, Graph.h and quadtree.h files in a single ZIP file called A00######.zip to the D2L dropbox, where A00###### is your A00 number.