Currently, only Dijkstra's algorithm for the shortest path is implemented for this problem.
- Implement Prim's and Kruskal's algorithm for Minimum Spanning Tree
- Implement any other greedy algorithm for this particular data.
- Maintain decent output design and features.
Currently, only Dijkstra's algorithm for the shortest path is implemented for this problem.