Implement the algorithm of finding the minimum spanning tree of a given undirected, weighted and connected simple graph.
The graph is expressed using an adjacency matrix.
The interface of the function would look like the one shown below:
double **MinimumSpanningTree(double **graph, int numOfNodes);
How would you change your program if the graph is expressed using an adjacency list?
Submit your work using the submit name LabA.