We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents ccf9653 + 6c9e8fd commit b7074c5Copy full SHA for b7074c5
BFS,py.py
@@ -0,0 +1,36 @@
1
+from collections import deque
2
+
3
+def bfs(adj, s):
4
5
+ queue = deque()
6
+ visited = [False] * len(adj)
7
8
+ queue.append(s)
9
+ visited[s] = True
10
11
+ while queue:
12
+ curr = queue.popleft()
13
+ print(curr, end = " ")
14
15
+ for x in range(len(adj[curr])) :
16
+ if not visited[x]:
17
+ queue.append(adj[curr][x])
18
+ visited[x] = True
19
20
+def add_edge(adj, u ,v):
21
+ adj[u].append(v)
22
+ adj[v].append(u)
23
24
+if __name__ == "__main__":
25
26
+ V = 5
27
+ adj = [[] for _ in range(V)]
28
29
+ add_edge(adj, 0, 1)
30
+ add_edge(adj, 0, 2)
31
+ add_edge(adj, 1, 2)
32
+ add_edge(adj, 1, 3)
33
+ add_edge(adj, 2, 3)
34
35
+bfs(adj,0)
36
0 commit comments