Please enable JavaScript.
Coggle requires JavaScript to display documents.
Pathfinding Algorithms - Coggle Diagram
Pathfinding Algorithms
Search Tree
A search tree is a tree data structure used to represent the paths explored by a pathfinding algorithm. Each node in the tree represents a state, and edges represent actions leading to successor states. The root node is the initial state, and leaf nodes are states with no successors.
Types of Searches
-
Uniform Cost Search: Expands the node with the lowest path cost, ensuring the shortest path is found.
Breadth-First Search (BFS): Explores all neighbor nodes at the present depth prior to moving on to nodes at the next depth level.
Greedy Best-First Search: Prioritizes nodes based on a heuristic function that estimates the cost to the goal, often leading to fast exploration but potentially missing the optimal solution.
-
The Frontier
The frontier represents the boundary between explored and unexplored nodes during a search algorithm. It contains nodes that are candidates for expansion based on the search strategy employed.
Leaf Node: A node that has no children, indicating it is a terminal state in the search space.
-
-
-
Binary Search Tree
A binary tree where each node has at most two children, and for every node, all values in the left subtree are smaller, and all values in the right subtree are larger. This property allows efficient searching, insertion, and deletion operations. 