Assignment $4$

Combine and extend the Graph classes in the textbook code $($adj $.$cpp and bfs$.$cpp$)$ to have a single Graph class with both DFS and BFS functions. Test your functions properly.

Implement the Kruskal's algorithm using adjacency matrix as graph representation.

Implement the Prim's algorithm using adjacency list as graph representation.

Modify the textbook code on single source shortest path to actually print out all the paths.