Python and Tkinter program to find the optimum solutions for different Greedy Algorithms.
The cost matrix to the different nodes of the graph is to be saved into the spare file. The program then works on this file to generate the Minimum Cost Spanning Tree Graph.