Graphs/BFS.cpp at main · AdityaSharma224/Graphs · GitHub

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
#include<bits/stdc++.h>
using namespace std;


vector<int>bfs(int v,vector<int>adj[])
{
    int vis[v] = {0};
    vis[0] = 1;

    queue<int>q;
    q.push(0);
    vector<int>ans;
    while(!q.empty())
    {
        int node = q.front();
        q.pop();
        ans.push_back(node);

        for(auto it:adj[node])
        {
            if(!vis[it])
            {
                vis[it]=1;
                q.push(it);
            }
        }
    }
    return ans;
}

void addEdge(vector<int>adj[],int u,int v)
{
    adj[u].push_back(v);
    adj[v].push_back(u);
}

int main()
{
    vector<int>adj[6];

    addEdge(adj,0,1);
    addEdge(adj,0,2);
    addEdge(adj,0,3);
    addEdge(adj,2,4);

    vector<int>ans = bfs(5,adj);
    for(int i=0;i<ans.size();i++){
        cout<<ans[i]<<" ";
    }
    cout<<endl;
}

// Complexity Analysis
// Time Complexity -> O(N)+O(2E);
// Space Complexity -> O(3N) ~O(N)