C++ Program to Find MST(Minimum Spanning Tree) using Prim's Algorithm

This C++ program depicts the Prim’s Algorithm which finds the minimal spanning tree(tree consisting of the minimum weights of edges connecting any two vertices) in a graph.

Here is the source code of the C++ program to display the destination node, start node and the weight of node connecting the two using Prim’s Algorithm such that the resultant values of weights of edges are the smallest possible. This C++ program is successfully compiled and run on DevCpp, a C++ compiler. The program output is given below.

```
/*
```

 * C++ Program to find MST(Minimum Spanning Tree) using

```
 * Prim's Algorithm
```
```
 */
```
```
#include <iostream>
```
```
#include <conio.h>
```
```
using namespace std;
```
```
struct node
```
```
{
```
```
    int fr, to, cost;
```
```
}p[6];
```
```
int c = 0, temp1 = 0, temp = 0;
```

void prims(int *a, int b[][7], int i, int j)

```
{
```
```
    a[i] = 1;
```
```
    while (c < 6)
```
```
    {
```
```
        int min = 999;
```
```
        for (int i = 0; i < 7; i++)
```
```
        {
```
```
            if (a[i] == 1)
```
```
            {
```

                for (int j = 0; j < 7; )

```
                {
```

                    if (b[i][j] >= min || b[i][j] == 0)

```
                    {
```
```
                        j++;
```
```
                    }
```

                    else if (b[i][j] < min)

```
                    {
```
```
                        min = b[i][j];
```
```
                        temp = i;
```
```
                        temp1 = j;
```
```
                    }
```
```
                }
```
```
            }
```
```
        }
```
```
        a[temp1] = 1;
```
```
        p[c].fr = temp;
```
```
        p[c].to = temp1;
```
```
        p[c].cost = min;
```
```
        c++;       
```

        b[temp][temp1] = b[temp1][temp]=1000;

```
    }
```
```
    for (int k = 0; k < 6; k++)
```
```
    {
```

        cout<<"source node:"<<p[k].fr<<endl;

        cout<<"destination node:"<<p[k].to<<endl;

        cout<<"weight of node"<<p[k].cost<<endl;

```
    }
```
```
}
```
```
int main()
```
```
{
```
```
    int a[7];
```
```
    for (int i = 0; i < 7; i++)
```
```
    {
```
```
        a[i] = 0;
```
```
    }
```
```
    int b[7][7];
```
```
    for (int i = 0; i < 7; i++)
```
```
    {
```

        cout<<"enter values for "<<(i+1)<<" row"<<endl;

```
        for (int j = 0; j < 7; j++)
```
```
        {
```
```
            cin>>b[i][j];
```
```
        }
```
```
    }
```
```
    prims(a, b, 0, 0);
```
```
    getch();
```
```
}
```

Output
enter values of adjacency matrix for a 7 node graph:
 
enter values for 1 row
0
3
6
0
0
0
0
enter values for 2 row
3
0
2
4
0
0
0
enter values for 3 row
6
2
0
1
4
2
0
enter values for 4 row
0
4
1
0
2
0
4
enter values for 5 row
0
0
4
2
0
2
1
enter values for 6 row
00
0
2
0
2
0
1
enter values for 7 row
0
0
0
4
1
1
0
MINIMUM SPANNING TREE AND ORDER OF TRAVERSAL:
 
source node:0
destination node:1
weight of node3
source node:1
destination node:2
weight of node2
source node:2
destination node:3
weight of node1
source node:2
destination node:5
weight of node2
source node:5
destination node:6
weight of node1
source node:6
destination node:4
weight of node1

Sanfoundry Global Education & Learning Series – 1000 C++ Programs.

If you wish to look at all C++ Programming examples, go to C++ Programs.

« Prev Page - C++ Program To Implement Self Organising List

» Next Page - C++ Program to Find SSSP(Single Source Shortest Path) in DAG(Directed Acyclic Graphs)

Deep Dive @ Sanfoundry: