This algorithm bases on the Dijkstra approach and adds an heuristic to find the best route from a starting point to a goal. It leads to a optimal solution, depending on the given heuristic. In this code we use the Euclidian distance as h-function.
-
Notifications
You must be signed in to change notification settings - Fork 0
jowect/A-Star-Algorithm
About
Dynamic Programming - Route Planning Algorithm
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published