Pathfinding Algorithms - Lesson 1 | Breadth First Search vs Depth First Search - BFS vs DFS
Breadth First Search and Depth First Search are two of the most common pathfinding algorithms. These pathfinding algorithms are known as uninformed search algorithms. The distinction between informed search and uninformed search is explained in the video. Top tech company recruiters are known to ask coding interview questions regarding BFS and DFS and so it pays to know these algorithms inside out. To answer these coding interview questions, you will need to be aware of what data structures bfs and dfs use - e.g a stack and a queue.
This video will teach you how BFS and DFS work. To demonstrate these algorithms, a visualizer is used. The visualiser includes pseudocode.
The video evaluates breadth first search and depth first search using the criteria of completeness and optimality with full explanation of both.