DAA-Lab/10.krushkal.cpp at main · githubhosting/DAA-Lab · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
#include <iostream>
#include <string.h>
using namespace std;
class Graph
{
    char vertices[10][10];
    int cost[10][10], no;

public:
    Graph();
    void creat_graph();
    void display();
    int Position(char[]);
    void kruskal_algo();
};

Graph::Graph()
{
    no = 0;
    for (int i = 0; i < 10; i++)
        for (int j = 0; j < 10; j++)
        {
            cost[i][j] = 999;
        }
}

void Graph::creat_graph()
{
    char ans, Start[10], End[10];
    int wt, i, j;
    cout << "Enter the number of vertices: ";
    cin >> no;
    cout << "\nEnter the vertices: ";
    for (i = 0; i < no; i++)
        cin >> vertices[i];
    do
    {
        cout << "\nEnter Start and End vertex of the edge: ";
        cin >> Start >> End;
        cout << "Enter weight: ";
        cin >> wt;
        i = Position(Start);
        j = Position(End);
        cost[i][j] = cost[j][i] = wt;
        cout << "\nDo you want to add more edges (Y=YES/N=NO)? : ";
        cin >> ans;
    } while (ans == 'y' || ans == 'Y');
}

void Graph::display()
{
    int i, j;
    cout << "\n\nCost matrix: ";
    for (i = 0; i < no; i++)
    {
        cout << "\n";
        for (j = 0; j < no; j++)
            cout << "\t" << cost[i][j];
    }
}

int Graph::Position(char key[10])
{
    int i;
    for (i = 0; i < 10; i++)
        if (strcmp(vertices[i], key) == 0)
            return i;
    return -1;
}
void Graph::kruskal_algo()
{
    int i, j, v[10] = {0}, x, y, Total_cost = 0, min, gr = 1, flag = 0, temp, d;
    while (flag == 0)
    {
        min = 999;
        for (i = 0; i < no; i++)
        {
            for (j = 0; j < no; j++)
            {
                if (cost[i][j] < min)
                {
                    min = cost[i][j];
                    x = i;
                    y = j;
                }
            }
        }
        if (v[x] == 0 && v[y] == 0)
        {
            v[x] = v[y] = gr;
            gr++;
        }
        else if (v[x] != 0 && v[y] == 0)
            v[y] = v[x];
        else if (v[x] == 0 && v[y] != 0)
            v[x] = v[y];
        else
        {
            if (v[x] != v[y])
            {
                d = v[x];
                for (i = 0; i < no; i++)
                {
                    if (v[i] == d)
                        v[i] = v[y];
                }
            }
        }
        cost[x][y] = cost[y][x] = 999;
        Total_cost = Total_cost + min;
        cout << "\n\t" << vertices[x] << "\t\t" << vertices[y] << "\t\t" << min;
        temp = v[0];
        flag = 1;
        for (i = 0; i < no; i++)
        {
            if (temp != v[i])
            {
                flag = 0;
                break;
            }
        }
    }
    cout << "\nTotal cost of the tree= " << Total_cost;
}
int main()
{
    Graph g;
    g.creat_graph();
    g.display();
    cout << "\n\n\nMinimum Spanning tree using kruskal algo=>";
    cout << "\nSource vertex\tDestination vertex\tWeight\n";
    g.kruskal_algo();
    return 0;
}