https://github.com/hxndev/finding-optimal-path-of-map-of-romania-using-a-star

A* is a graph traversal and path search algorithm, which is often used in many fields of computer science due to its completeness, optimality, and optimal efficiency
https://github.com/hxndev/finding-optimal-path-of-map-of-romania-using-a-star

a-star a-star-algorithm a-star-path-finding code graph map optimal-path python romania shortest-paths

Last synced: 3 months ago
JSON representation

A* is a graph traversal and path search algorithm, which is often used in many fields of computer science due to its completeness, optimality, and optimal efficiency

• Host: GitHub
• URL: https://github.com/hxndev/finding-optimal-path-of-map-of-romania-using-a-star
• Owner: HxnDev
• License: mit
• Created: 2021-07-28T05:33:54.000Z (about 4 years ago)
• Default Branch: main
• Last Pushed: 2021-07-28T05:34:24.000Z (about 4 years ago)
• Last Synced: 2025-05-07T13:48:41.193Z (5 months ago)
• Topics: a-star, a-star-algorithm, a-star-path-finding, code, graph, map, optimal-path, python, romania, shortest-paths
• Language: Python
• Homepage: https://github.com/HxnDev/Finding-Optimal-Path-of-Map-of-Romania-Using-A-Star
• Size: 9.77 KB
• Stars: 6
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: Readme.md
  • License: LICENSE

Awesome Lists containing this project

README

          

All the files have been commented for your ease. Furthermore you may also add further comments if you may.

For further queries contact me at : chhxnshah@gmail.com