Coding Example: Find shortest path in a maze (Breadth-First approach)
In this lesson, we will implement the solution of finding shortest path in the maze that we build in the previous lesson. To find the shortest path, we will use the BFS strategy.
We'll cover the following...
Breadth-First Algorithm
The breadth-first (as well as depth-first) search algorithm addresses the problem of finding a path between two nodes by examining all possibilities starting from the root node and stopping as soon as a solution has been found (destination node has been reached). This algorithm runs in linear time with complexity in ...
Access this course and 1400+ top-rated courses and projects.