-
Notifications
You must be signed in to change notification settings - Fork 0
/
bfs_adj_matrix.cpp
81 lines (76 loc) · 1.75 KB
/
bfs_adj_matrix.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
// Author: Jony Bepary <sohelahmedjony@gmail.com>
// 2022
// @jbeary
// http://jony-blog.github.io/
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<vector<bool>> adj_mat;
void vct_print(adj_mat &ara, int number_vertices)
{
for (int i = 1; i < number_vertices; i++)
{
for (int j = 1; j < number_vertices; j++)
{
cout << ara[i][j] << " ";
}
cout << endl;
}
}
void add_edge(adj_mat &ara, int u, int v)
{
ara[u][v] = true;
ara[v][u] = true;
}
bool bfs(adj_mat &ara, int start, int item)
{
queue<int> q;
q.push(start);
int current;
vector<bool> vis(ara.size(), false);
while (!q.empty())
{
current = q.front();
q.pop();
if (vis[current])
continue;
for (int j = 0; j < ara[current].size(); j++)
{
if (ara[current][j])
{
if (j == item)
{
cout << "item found !!\n";
return 0;
}
else
{
q.push(j);
}
}
}
vis[current] = true;
}
cout << "item not found !!\n";
return false;
}
int main()
{
int number_vertices = 7;
adj_mat ara(number_vertices + 2, vector<bool>(number_vertices + 2, false));
// vct_print(ara, number_vertices);
add_edge(ara, 6, 4);
add_edge(ara, 4, 5);
add_edge(ara, 4, 3);
add_edge(ara, 5, 1);
add_edge(ara, 5, 2);
add_edge(ara, 2, 3);
add_edge(ara, 1, 2);
// cout << "\n\n-----------------------\n\n";
// vct_print(ara, number_vertices);
bfs(ara, 6, 7);
return 0;
}