Please enable JavaScript.
Coggle requires JavaScript to display documents.
Path Finding Algorithms - Coggle Diagram
Path Finding Algorithms
Searching
Uninformed Search
Depth Limited
Reverse when dead end
Uniform Cost
Iterative Deeping Depth First
Breath First
FIFO
USe Queue
Bidirectional
Depth First
LIFO
Use Stack
Informed Search
Best First Search
Includes Heuristic
Greedy Best First Search
After shifting one layer to another not consider about previous one
A*
An improvement
Frontier
Set of leaf nodes
Search Tree
Branch
Action
Node
State
Measuring Performance
Optimality
Time Complexity
Completeness
Space Complexity
Generic Algorithms
Measure fitness of each possibility
Random mutation
Slime Mould
Dijkstra Algorithm
Finding the shortest path
Last cost path