In this post, I introduce two fundamental search algorithms used to traverse or search through graphs or tree data structures: breadth-first search (BFS), and depth-first search (DFS). I also present an overview of a path/search navigation scripts for both algorithms and compare their metrics. This post builds on my earlier post about stack and queue … Continue reading Search Algorithms and Path Navigation