-
Notifications
You must be signed in to change notification settings - Fork 0
/
BFS of graph.cpp
70 lines (63 loc) · 1.3 KB
/
BFS of graph.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
//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
// Function to return Breadth First Traversal of given graph.
vector<int> bfsOfGraph(int V, vector<int> adj[])
{
vector<int> ans;
vector<int> vis(V, 0);
queue<int> q;
q.push(0);
vis[0] = 1;
while (!q.empty())
{
int x = q.front();
ans.push_back(x);
q.pop();
for (auto i : adj[x])
{
if (!vis[i])
{
vis[i] = 1;
q.push(i);
}
}
}
return ans;
}
};
//{ Driver Code Starts.
int main()
{
int tc;
cin >> tc;
while (tc--)
{
int V, E;
cin >> V >>
E;
vector<int> adj[V];
for (int i = 0; i < E; i++)
{
int u, v;
cin >> u >> v;
adj[u].push_back(v);
// adj[v].push_back(u);
}
// string s1;
// cin>>s1;
Solution obj;
vector<int> ans = obj.bfsOfGraph(V, adj);
for (int i = 0; i < ans.size(); i++)
{
cout << ans[i] << " ";
}
cout << endl;
}
return 0;
}
// } Driver Code Ends