Please enable JavaScript.
Coggle requires JavaScript to display documents.
Pathfinding algorithms - Coggle Diagram
Pathfinding algorithms
Types of search
Uninformed search
Breath First Search(BFS)
Simple strategy in which the root node is expanded fist ,then all the succesors
-
-
-
-
Informed search
A* search finds the path from a start vertex to a goal vertex by considering both the cost of the path
bestfirstpath
explores a graph by always selecting the most pomising vertex based on a heuristic function
Dijkstra’s algoritham
find the shortest path between a start and all other vertex in a weighted graph
Greedy best first
explores a graph by priotizing verifies based on a heuristic function that estimate their proximity to the goal
-
-
-
