-
Notifications
You must be signed in to change notification settings - Fork 0
/
source.cpp
74 lines (56 loc) · 1.38 KB
/
source.cpp
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
#include <iostream>
using namespace std;
int ary[10][10], completed[10], n, cost = 0;
void takeInput() {
int i, j;
cout << "Enter the number of villages: ";
cin >> n;
cout << "\nEnter the Cost Matrix\n";
for (i = 0; i < n; i++) {
cout << "Enter Elements of Row: " << i + 1 << "\n";
for (j = 0; j < n; j++)
cin >> ary[i][j];
completed[i] = 0;
}
cout << "\n\nThe cost list is:";
for (i = 0; i < n; i++) {
cout << "\n";
for (j = 0; j < n; j++)
cout << "\t" << ary[i][j];
}
}
int least(int c) {
int i, nc = 999;
int min = 999, kmin;
for (i = 0; i < n; i++) {
if ((ary[c][i] != 0) && (completed[i] == 0))
if (ary[c][i] + ary[i][c] < min) {
min = ary[i][0] + ary[c][i];
kmin = ary[c][i];
nc = i;
}
}
if (min != 999)
cost += kmin;
return nc;
}
void mincost(int city) {
int i, ncity;
completed[city] = 1;
cout << city + 1 << " → ";
ncity = least(city);
if (ncity == 999) {
ncity = 0;
cout << ncity + 1;
cost += ary[city][ncity];
return;
}
mincost(ncity);
}
int main() {
takeInput();
cout << "\n\nThe Path is:\n";
mincost(0); // passing 0 because starting vertex
cout << "\n\nMinimum cost is " << cost;
return 0;
}