Scribd
Upload
8 views3 pages

Prims Algo

This C++ program implements Prim's algorithm to find the minimum spanning tree of a graph with 5 vertices. It initializes a graph represented as an adjacency matrix and uses arrays to track the minimum weights and parent nodes. The program outputs the edges and their corresponding weights that form the minimum spanning tree.

Uploaded by

228 - CM - Wagh Tejas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8 views3 pages

Prims Algo

This C++ program implements Prim's algorithm to find the minimum spanning tree of a graph with 5 vertices. It initializes a graph represented as an adjacency matrix and uses arrays to track the minimum weights and parent nodes. The program outputs the edges and their corresponding weights that form the minimum spanning tree.

Uploaded by

228 - CM - Wagh Tejas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

C++ program Prims algorithm

#include <iostream>
#include <vector>
#include <climits>

using namespace std;

const int V = 5;

int graph[V][V] = {
{0, 2, 0, 6, 0},
{2, 0, 3, 8, 5},
{0, 3, 0, 0, 7},
{6, 8, 0, 0, 9},
{0, 5, 7, 9, 0}
};

int main() {
int parent[V];
int key[V];
bool mstSet[V];

for (int i = 0; i < V; i++) {


key[i] = INT_MAX;
mstSet[i] = false;
}
key[0] = 0;
parent[0] = -1;

for (int count = 0; count < V - 1; count++) {


int u = -1;
for (int v = 0; v < V; v++) {
if (!mstSet[v] && (u == -1 || key[v] < key[u])) {
u = v;
}
}

mstSet[u] = true;

for (int v = 0; v < V; v++) {


if (graph[u][v] && !mstSet[v] && graph[u][v] < key[v]) {
parent[v] = u;
key[v] = graph[u][v];
}
}
}

cout << "Edge \tWeight\n";


for (int i = 1; i < V; i++) {
cout << parent[i] << " - " << i << "\t" << graph[i][parent[i]] << "\n";
}
return 0;
}

You might also like