Part 1: Depth-First Search — What is a graph data structure? A Graph is a data structure consisting of finite number of nodes (or vertices) and edges that connect them. Consider the picture below:

Part 2: Breadth-First Search — To check out Depth-First Search, check out part 1. Breadth-First Search (BFS) Unlike DFS, which goes deep in a certain direction first before considering another direction, BFS will analyze the next node in each possible direction first and then repeat the process for the next node in each direction. So instead of working…

Introduction to Best-First Search and how to implement it in Python, along with the pros and cons. — Informed search algorithms In the previous articles, we talked about depth-first and breadth-first searches. One thing common between the two is that they are sort of blindly searching through the node, not taking into account any knowledge of the goal. That way, they are uninformed algorithms. …