C++

// main.cpp // Please insert your code snippet according to the comments #include  #include  // Number of vertices in the graph #define V 5 // A utility function to find the vertex with minimum key value, from // the set of vertices not yet included in MST int EXTRACT_MIN(int key[], bool mstSet[]) { // Initialize min_index int min_index; //************* Insert code here (15 pts.) ************************** //******************************************************************* return min_index; } // A utility function to print the constructed MST stored in parent[] void printMST(int parent[], int n, int graph[V][V]) { printf("Edge Weight "); for (int i = 1; i