algorithm_lab/bfs.cpp at main · imashiqe/algorithm_lab · 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
#include <iostream>
#include <vector>
#include <queue>
using namespace std;


const int N = 6;

vector<int> edges[N];

void bfs(int start) {
    vector<bool> visited(N, false);
    queue<int> q;

    visited[start] = true;
    q.push(start);

    while (!q.empty()) {
        int node = q.front();
        q.pop();
        cout << node << " ";

        for (int neighbor : edges[node]) {
            if (!visited[neighbor]) {
                visited[neighbor] = true;
                q.push(neighbor);
            }
        }
    }
}

int main() {

    edges[1].emplace_back(2);
    edges[2].emplace_back(1);
    edges[1].emplace_back(3);
    edges[3].emplace_back(1);
    edges[1].emplace_back(5);
    edges[5].emplace_back(1);
    edges[2].emplace_back(4);
    edges[4].emplace_back(2);
    edges[5].emplace_back(4);
    edges[4].emplace_back(5);
    edges[3].emplace_back(4);
    edges[4].emplace_back(3);


    cout << "BFS starting from node 1: ";
    bfs(1);

    return 0;
}