-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGraphIntro5.cpp
More file actions
71 lines (49 loc) · 908 Bytes
/
GraphIntro5.cpp
File metadata and controls
71 lines (49 loc) · 908 Bytes
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
//Bfs Traversal of Graph
#include<bits/stdc++.h>
#define ll long long
using namespace std;
template<typename T>
class Graph {
map<T, list<T> > l;
public:
void addEdge(T, T);
void BFS(T);
};
template<class T>
void Graph<T>::addEdge(T src, T dest) {
l[src].push_back(dest);
l[dest].push_back(src);
}
template<class T>
void Graph<T>::BFS(T start) {
map<T, int> visited;
queue<T> q;
q.push(start);
visited[start] = true;
while (!q.empty()) {
T node = q.front();
q.pop();
cout << node << " ";
for (int nbr : l[node]) {
if (!visited[nbr]) {
q.push(nbr);
//Mark that nbr is visited
visited[nbr] = true;
}
}
}
}
int main() {
Graph<int> g;
g.addEdge(0, 1);
g.addEdge(1, 2);
g.addEdge(2, 3);
g.addEdge(3, 4);
g.addEdge(4, 5);
g.BFS(0);
return 0;
}
/****
Output :
0 1 2 3 4 5
***/