-
Notifications
You must be signed in to change notification settings - Fork 2
/
bfs.cpp
113 lines (91 loc) · 1.87 KB
/
bfs.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
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
#include<iostream>
using namespace std;
void get_matrix(int n, int W[20][20])
{
cout << "Enter adjacency matrix ";
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
cin >> W[i][j];
}
void BFS(int n, int W[20][20])
{
int source;
int visited[20];
int queue[20];
int front = 0, rear = -1, u ,v;
for(int i=1;i<=n;i++)
visited[i]=0;
cout << " Enter the source node: ";
cin >> source;
visited[source]=1;
queue[++rear] = source;
while(front <= rear)
{
u = queue[front++];
for(v=1; v<=n; v++)
{
if(W[u][v] && !visited[v])
{
queue[++rear] = v;
visited[v] = 1;
}
}
}
for(int i=1; i<=n; i++)
{
if(visited[i])
cout << "Node " << i <<" is reachable. " << endl;
else
cout << "Node " << i <<" is not reachable. " <<endl;
}
}
int main()
{
int n,W[20][20];
cout << " Enter number of vertices: ";
cin >> n;
get_matrix(n, W);
BFS(n,W);
}
/* OUTPUT 1
Ashwanis-MacBook-Air:~ Ashwani$ ./a.out
Enter number of vertices: 5
Enter adjacency matrix
0 1 1 0 0
1 0 1 0 0
1 1 0 0 0
0 0 0 0 1
0 0 0 1 0
Enter the source node: 1
Node 1 is reachable.
Node 2 is reachable.
Node 3 is reachable.
Node 4 is not reachable.
Node 5 is not reachable.
*/
/* OUTPUT 2
Ashwanis-MacBook-Air:~ Ashwani$ ./a.out
Enter number of vertices: 10
Enter adjacency matrix
0 0 1 1 1 0 0 0 0 0
0 0 0 0 1 1 0 0 0 0
1 0 0 1 0 1 0 0 0 0
1 0 1 0 0 0 0 0 0 0
1 1 0 0 0 1 0 0 0 0
0 1 1 0 1 0 0 0 0 0
0 0 0 0 0 0 0 1 0 1
0 0 0 0 0 0 1 0 1 0
0 0 0 0 0 0 0 1 0 1
0 0 0 0 0 0 1 0 1 0
Enter the source node: 1
Node 1 is reachable.
Node 2 is reachable.
Node 3 is reachable.
Node 4 is reachable.
Node 5 is reachable.
Node 6 is reachable.
Node 7 is not reachable.
Node 8 is not reachable.
Node 9 is not reachable.
Node 10 is not reachable.
*/