Breaking News: Grepper is joining You.com. Read the official announcement!

bfs code using vector

Hemant kumar answered on July 30, 2022 Popularity 3/10 Helpfulness 1/10

answer bfs code using vector

bfs code using vector

Comment

// A Quick implementation of BFS using
// vectors and queue
#include <bits/stdc++.h>
#define pb push_back
 
using namespace std;
 
vector<bool> v;
vector<vector<int> > g;
 
void edge(int a, int b)
{
    g[a].pb(b);
 
    // for undirected graph add this line
    // g[b].pb(a);
}
 
void bfs(int u)
{
    queue<int> q;
 
    q.push(u);
    v[u] = true;
 
    while (!q.empty()) {
 
        int f = q.front();
        q.pop();
 
        cout << f << " ";
 
        // Enqueue all adjacent of f and mark them visited
        for (auto i = g[f].begin(); i != g[f].end(); i++) {
            if (!v[*i]) {
                q.push(*i);
                v[*i] = true;
            }
        }
    }
}
 
// Driver code
int main()
{
    int n, e;
    cin >> n >> e;
 
    v.assign(n, false);
    g.assign(n, vector<int>());
 
    int a, b;
    for (int i = 0; i < e; i++) {
        cin >> a >> b;
        edge(a, b);
    }
 
    for (int i = 0; i < n; i++) {
        if (!v[i])
            bfs(i);
    }
 
    return 0;
}

Popularity 3/10 Helpfulness 1/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ using vector

Link to this answer
Share Copy Link

Contributed on Jul 30 2022

Hemant kumar

0 Answers Avg Quality 2/10

bfs code using vector

Contents

More Related Answers

bfs code using vector

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.