forked from profpiyush/Hacktberfest-2021
-
Notifications
You must be signed in to change notification settings - Fork 0
/
BFS.cpp
86 lines (72 loc) · 1.57 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
#include<bits/stdc++.h>
using namespace std;
void addEdge(int u,int v,vector<int>adjlist[])
{
adjlist[u].push_back(v);
adjlist[v].push_back(u);
}
vector<int> BfsOfGraph(int N,vector<int>adjlist[])
{
vector<int>bfs;
vector<int>vis(N+1,0);
for(int i=1;i<=N;i++)
{
if(!vis[i])//vis[i]==0
{
queue<int>q;
q.push(i);
vis[i]=1;
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]=1;
}
}
}
}
}
return bfs;
}
void PrintGraph(int N, vector<int>adjlist[])
{
for (int i = 1; i <= N; i++)
{
cout<<"Node "<<i<<"->";
for(auto it : adjlist[i])
{
cout<<it<<"->";
}
cout<<"\n";
}
}
int main()
{
int N;
cout<<"Enter the no. of nodes of a graph:";
cin>>N;
int E;
cout<<"Enter the no. of Edges:\n";
cin>>E;
vector<int>AdjList[N+1];
cout<<"Enter the edges:\n";
for(int i=0;i<E;i++)
{
int u,v;
cin>>u>>v;
addEdge(u,v,AdjList);
}
PrintGraph(N,AdjList);
vector<int>ans=BfsOfGraph(N,AdjList);
for(auto it : ans)
{
cout<<it<<" ";
}
return 0;
}