-
Notifications
You must be signed in to change notification settings - Fork 2
/
bfs.cpp
76 lines (67 loc) · 1.33 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
#include<bits/stdc++.h>
using namespace std;
vector<int> bfs(vector<int>adjList[], int n) {
vector<bool>vis(n, false);
vector<int>bfs;
queue<int> q;
for(int i = 0; i < n; i++) {
if(!vis[i]) {
q.push(i);
vis[i] = true;
while(!q.empty()) {
int node = q.front();
q.pop();
bfs.push_back(node);
for(auto it : adjList[node]) {
if(!vis[it]) {
q.push(it);
vis[it] = true;
}
}
}
}
}
return bfs;
}
int main() {
cout << "Enter number of Nodes : ";
int n;
cin >> n;
vector<int>adjList[n];
cout << "Enter number of Edges : ";
int e;
cin >> e;
cout << "Enter Edges : \n";
for(int i = 0; i < e; i++) {
int u, v;
cin >> u >> v;
adjList[u].push_back(v);
adjList[v].push_back(u);
}
for(int i = 0; i < n; i++) {
cout << i << " : ";
for(auto i : adjList[i]) {
cout << i << " ";
}
cout << endl;
}
cout << endl;
vector<int>ans = bfs(adjList, n);
for(auto it : ans) {
cout << it << " ";
}
cout << endl;
return 0;
}
/*
6 9
0 1
0 2
0 3
1 3
1 4
1 5
2 3
3 5
4 5
*/