-
Notifications
You must be signed in to change notification settings - Fork 0
/
dfs_and_bfs.py
52 lines (44 loc) · 1.44 KB
/
dfs_and_bfs.py
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
from queue import Queue
class graph:
def __init__(self, n:int):
self.n = n
self.vecini = {i:set({}) for i in range(n+1)}
#self.visited = [ False for i in range(self.n + 1) ]
def addEdge(self, x:int, y:int)->None:
self.vecini[x].add(y)
self.vecini[y].add(x)
def DFS(self,node:int)->None:
visited = [False for i in range(self.n + 1)]
self.DFS_wrapped_function(node, visited)
def DFS_wrapped_function(self, node: int, visited:list) -> None:
visited[ node ] = True
print(node, end=" ")
for i in self.vecini[ node ]:
if not visited[ i ]:
self.DFS(i, visited)
def BFS(self, node: int)->None:
visited = [False for i in range(self.n + 1)]
q = [node]
visited[ node ] = True
while( len(q) > 0 ):
print(q[0], end=" ")
for i in self.vecini[ q[0] ]:
if not visited[ i ]:
q.append(i)
visited[i] = True
q.pop(0)
def liste_de_adiacenta(self):
for i in range(self.n+1):
print(i, end=": ")
for j in self.vecini[i]:
print(j, end=", ")
print("")
if __name__ == "__main__":
alfa = graph(8)
alfa.addEdge(2, 4)
alfa.addEdge(5, 3)
alfa.addEdge(6, 2)
alfa.addEdge(2, 5)
alfa.liste_de_adiacenta()
alfa.DFS(2)
alfa.BFS(2)