You are required to implement Kruskal's algorithm for finding a Minimum Spanning Tree of Graph. This will require implementing :
- A Graph Data Type (including a display method to show adjacencies)
- A Cycle Checker (as described in lecture notes)
- An Edge class
- A sorting algorithm to sort an array of Edges
- A class to implement Kruskal's algorithm
- A program to run and Test the algorithm