Please enable JavaScript.
Coggle requires JavaScript to display documents.
Path Finding Algorithms - Coggle Diagram
Path Finding Algorithms
Measuring performance
Completeness
Optimality
Time complexity
Space complexity
Informed search
Best first search
Dijkstra Algorithm
Greedy best first search
A*
Graph search
Uninformed search
Iterative deepening depth first
This limit gradually
increases
Bidirectional
Depth first
LIFO
Backtracking search uses less memory
Uniform cost
Expands node with lowest path cost
Changes order of queue
Breadth first
FIFO
Memory bigger problem than execution time
Depth limited
What is the diameter of the problem
Has a predetermined limit