-
Notifications
You must be signed in to change notification settings - Fork 2
/
graph.cc
76 lines (59 loc) · 1.12 KB
/
graph.cc
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
#include <iostream>
#include <vector>
#include <list>
#include <queue>
using namespace std;
struct graph {
vector<list<int> > adj;
graph(int count) {
adj.resize(count);
}
void add(int from, int to) {
adj[from].push_back(to);
}
};
void dfs(graph &g, int v, bool visited[])
{
if (visited[v] == true)
return;
visited[v] = true;
cout << v << endl;
for (auto &w : g.adj[v]) {
if (visited[w] == false)
dfs(g, w, visited);
}
}
void bfs(graph &g, int v)
{
bool visited[4] = {false};
queue<int> q;
q.push(v);
while (!q.empty()) {
v = q.front();
q.pop();
visited[v] = true;
cout << v << endl;
for (auto &w : g.adj[v]) {
if (visited[w] == false)
q.push(w);
}
}
}
int main()
{
struct graph g(4);
bool visited[4] = { false };
g.add(0, 1);
g.add(0, 2);
g.add(1, 2);
g.add(2, 0);
g.add(2, 3);
g.add(3, 3);
/*
for (int i = 0; i < 4; i++)
visited[i] = false;
*/
dfs(g, 2, visited);
bfs(g, 2);
return 0;
}