#include<iostream>
using namespace std;
int weight[10][10],nodes;
int visited[10];

class prims
{
    int i,j,min,k,l,m,total_cost;
    public:
    void getdata();
    void matrix();
    void MST();
};

void prims::getdata()
{
    for(i=0;i<nodes;i++)
    {
        visited[i]=0;
    }
    cout<<"———————————————————————————————————————————\n";
    cout<<"Program for the Prim's algorithm\n";
    cout<<"———————————————————————————————————————————\n";
    cout<<"Enter the total number of nodes ";
    cin>>nodes;
    cout<<"\nEnter the distance of edges\n";
    for(i=0;i<nodes;i++)
    {
        for(j=0;j<nodes;j++)
        {
            cin>>weight[i][j];
        }
        cout<<"\n";
    }
}

void prims::matrix()
{
    cout<<"Adjacency matrix is\n ";
    for(i=0;i<nodes;i++)
    {
        for(j=0;j<nodes;j++)
        {
            cout<<"\t"<<weight[i][j];
        }
        cout<<"\n";
    }
}

void prims::MST()
{
    min=9999;
    total_cost=0;
    for(i=0;i<nodes;i++)
    {
        for(j=0;j<nodes;j++)
        {
            if(weight[i][j]<min&&weight[i][j]!=0)
            {
                min=weight[i][j];
                k=i;
                l=j;
            }
        }
    }
    cout<<"\nEdge "<<k<<"-"<<l<<" Having Distance "<<min;
    visited[k]=1;
    visited[l]=1;
    total_cost=min;
    for(m=0;m<nodes-2;m++)
    {
        min=9999;
        for(i=0;i<nodes;i++)
        {
            if(visited[i]==1)
            {
                for(j=0;j<nodes;j++)
                {
                    if(visited[j]!=1)
                    {
                        if(weight[i][j]<min&&weight[i][j]!=0)
                        {
                        min=weight[i][j];
                        k=i;
                        l=j;
                        }
                    }
                }
            }
        }
        cout<<"\nEdge "<<k<<"-"<<l<<" having distance "<<min;
        visited[k]=1;
        visited[l]=1;
        total_cost=total_cost+min;
    }
    cout<<"\nTotal cost is "<<total_cost;
    cout<<"\n";
}
int main()
{
    prims p;
    p.getdata();
    p.matrix();
    p.MST();
    return 0;
}

kodingwindow@kw:~$ g++ kw.cpp
kodingwindow@kw:~$ ./a.out
———————————————————————————————————————————
Program for the Prim's algorithm
———————————————————————————————————————————
Enter the total number of nodes 6

Enter the distance of edges
0 6 11 2 0 2

6 0 4 7 0 3

11 4 0 2 0 6

2 7 2 0 9 1

0 0 0 9 0 14

2 3 6 1 14 0

Adjacency matrix is
 	0	6	11	2	0	2
	6	0	4	7	0	3
	11	4	0	2	0	6
	2	7	2	0	9	1
	0	0	0	9	0	14
	2	3	6	1	14	0

Edge 3-5 Having Distance 1
Edge 3-0 having distance 2
Edge 3-2 having distance 2
Edge 5-1 having distance 3
Edge 3-4 having distance 9
Total cost is 17
kodingwindow@kw:~$