Improved Graph Algorithms
Experiment 7
Improvements:
1. Set is using BST now. So O(log n) look ups.
2. Union find is improved to work with Lg* n look up time.
3. BFS uses proper queue
4. Each algo, DFS, BFS, Prim and Kruskal are in their own files.