Implementation of Kruskal’s Algorithm:
You are required to implement Kruskal’s algorithm for determining a Minimum Spanning Tree of Graph. This will require implementing:
A) A Graph Data Type (comprising a display method to show adjacencies).
B) The Cycle Checker.
C) An Edge class.
D) Sorting algorithm to sort an array of Edges.
E) A class to implement the Kruskal’s algorithm.
F) Program to run and Test the algorithm.