A Comprehensive Guide to Graph Search in Python- Part 3: Best First Search
Published in
5 min readMay 17, 2021
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. In other words, they have…