BFS Python#

 1graph = {
 2    "v1": ["v2", "v3", "v4"],
 3    "v2": ["v1", "v5", "v6"],
 4    "v3": ["v1"],
 5    "v4": ["v1", "v6"],
 6    "v5": ["v2"],
 7    "v6": ["v2", "v4"],
 8}
 9
10visited = []  # List for visited nodes.
11queue = []  # Initialize a queue
12
13
14def bfs(graph, node):  # function for BFS
15
16    visited.append(node)
17    queue.append(node)
18
19    while queue:
20        m = queue.pop(0)
21        for neighbor in graph[m]:
22            if neighbor not in visited:
23                visited.append(neighbor)
24                queue.append(neighbor)
25
26
27bfs(graph=graph, node="v1")
28
29print(visited)