Scribd
Upload
2 views1 page

Practis

The document contains implementations of Breadth-First Search (BFS) and Depth-First Search (DFS) algorithms for traversing a graph. It defines a graph structure and provides functions for both traversal methods, printing the nodes as they are visited. The BFS uses a queue while the DFS uses recursion to explore the graph.

Uploaded by

sdking1811
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
2 views1 page

Practis

The document contains implementations of Breadth-First Search (BFS) and Depth-First Search (DFS) algorithms for traversing a graph. It defines a graph structure and provides functions for both traversal methods, printing the nodes as they are visited. The BFS uses a queue while the DFS uses recursion to explore the graph.

Uploaded by

sdking1811
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

# ### BFS

# graph = {
# '5': ['3', '7'],
# '3': ['2', '4'],
# '7': ['8'],
# '2': [],
# '4': ['8'],
# '8': []
# }

# visited = [] # List for visited nodes.


# queue = [] # Initialize a queue.

# def bfs(visited, graph, node): # Function for BFS.


# visited.append(node)
# queue.append(node)

# while queue: # Creating loop to visit each node.


# m = queue.pop(0)
# print(m, end=" ")

# for neighbour in graph[m]:


# if neighbour not in visited:
# visited.append(neighbour)
# queue.append(neighbour)

# # Driver Code.
# print("Following is the Breadth-First Search:")
# bfs(visited, graph, '5') # Function calling.

### DFS
graph = {
'5': ['3', '7'],
'3': ['2', '4'],
'7': ['8'],
'2': [],
'4': ['8'],
'8': []
}

visited = [] # Set to keep track of visited nodes of graph.

def dfs(visited, graph, node): # Function for DFS.


if node not in visited:
print(node)
visited.append(node)
for neighbour in graph[node]:
dfs(visited, graph, neighbour)

# Driver Code.
print("Following is the Depth-First Search:")
dfs(visited, graph, '5')

You might also like