S - start point
E - end point
@ - path
# - obstacle
1 - cost
manhattan vs euclidean heuristic distance
finds the cheapest path (. is 1 by default)
in some cases B* can't find the shortest path, A* always finds the shortest or cheapest path
-
Notifications
You must be signed in to change notification settings - Fork 1
shkolovy/path-finder-algorithms
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
BFS, Dijkstra, Best First Search, A*
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published