https://github.com/ivanbgd/a-star_algorithm

Several different implementations of the A-Star search algorithm, including a Bidirectional version - used for finding the shortest path in a graph.
https://github.com/ivanbgd/a-star_algorithm

a-star-algorithm bidirectional-a-star-algorithm graph-algorithms graphs planar-graphs python

Last synced: 12 months ago
JSON representation

Several different implementations of the A-Star search algorithm, including a Bidirectional version - used for finding the shortest path in a graph.

• Host: GitHub
• URL: https://github.com/ivanbgd/a-star_algorithm
• Owner: ivanbgd
• License: mit
• Created: 2017-09-21T23:52:51.000Z (over 8 years ago)
• Default Branch: master
• Last Pushed: 2025-02-13T09:00:54.000Z (about 1 year ago)
• Last Synced: 2025-03-25T06:24:15.393Z (about 1 year ago)
• Topics: a-star-algorithm, bidirectional-a-star-algorithm, graph-algorithms, graphs, planar-graphs, python
• Language: Python
• Homepage:
• Size: 8.79 KB
• Stars: 23
• Watchers: 0
• Forks: 4
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# A-Star (A*) Algorithm

Several different implementations of the [A-Star search algorithm](https://en.wikipedia.org/wiki/A*_search_algorithm), including a Bidirectional version.

The algorithm is used for graph traversal and for finding the shortest path in a graph.

It is an improved version of the [Dijkstra's Shortest path algorithm](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm).