This Project uses STL to implement A* Search to find the minimum path between two cities given a map. The example is taken from the book AI: A Modern Approach, 3rd Ed., by Russel, where a map of Romania is given. The target node is Bucharest, and the user can specify the initial city from which the search algorithm will start looking for the minimum path to Bucharest.
-
Notifications
You must be signed in to change notification settings - Fork 0
This Project uses STL to implement A* Search to find the minimum path between two cities given a map. The example is taken from the book AI: A Modern Approach, 3rd Ed., by Russel, where a map of Romania is given. The target node is Bucharest, and the user can specify the initial city from which the search algorithm will start looking for the min…
aisabhay/STL-A-Star-Algorithm
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This Project uses STL to implement A* Search to find the minimum path between two cities given a map. The example is taken from the book AI: A Modern Approach, 3rd Ed., by Russel, where a map of Romania is given. The target node is Bucharest, and the user can specify the initial city from which the search algorithm will start looking for the min…
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published