Using Java, Python, or ANSI/ISO C++, write a program tha t: Implements Prim’s al

Question

Using Java, Python, or ANSI/ISO C++, write a program that:

Implements Prim’s algorithm for finding the minimum spanning tree of a weighted graph. Your program should conform to the following specifications.

Prompt the user for the number of vertices in the graph.

Prompt the user to enter the adjacency matrix of the graph one row at a time.

Print the adjacency matrix of the graph.

Print the weight of the minimum spanning tree.

Print the list of edges in the minimum spanning tree.

Explanation / Answer

#include #include #include #include #include using namespace std; const int MAX = 1e4 + 5; typedef pair PII; bool marked[MAX]; vector adj[MAX]; long long prim(int x) { priority_queue Q; int y; long long minimumCost = 0; PII p; Q.push(make_pair(0, x)); while(!Q.empty()) { // Select the edge with minimum weight p = Q.top(); Q.pop(); x = p.second; // Checking for cycle if(marked[x] == true) continue; minimumCost += p.first; marked[x] = true; for(int i = 0;i > nodes >> edges; for(int i = 0;i > x >> y >> weight; adj[x].push_back(make_pair(weight, y)); adj[y].push_back(make_pair(weight, x)); } // Selecting 1 as the starting node minimumCost = prim(1); cout

Related Questions

Navigate

• Browse (All)
• Browse U
• Subjects

---