Searching in Graphs
Breadth-first search (BFS) algorithm
The following example shows how the BFS algorithm works. Using the
Remove node C and process it, then add its children.
Let's see how you can implement the BFS algorithm in Python.
queue.append(node)
Practical Applications of the BFS Algorithm
The (BFS) algorithm can be developed by defining the starting point (Initial State)
Depth-first search (DFS) algorithm
Practical Applications of the DFS Algorithm
Table 2.4: Comparison of the BFS and DFS algorithms
Read the sentences and tick True or False.
Explain how the BFS algorithm and the DFS algorithm work.
Compare the differences between the BFS and DFS algorithms.
In the diagram to the right, you want to go from
Write a Python function that performs BFS on a graph to check if there is a path between two given nodes.
Write a Python function that uses DFS to find the shortest path in a graph.
