FazBrowse GitHub Viewer | Trending | | Home

Tools: [Download Repo ZIP] [Original HTTPS Page]

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. · GitHub

Name		Name	Last commit message	Last commit date
A-Star.py		A-Star.py
A-Star_opt.py		A-Star_opt.py
A-Star_precompute_h.py		A-Star_precompute_h.py
Bidirectional_A-Star.py		Bidirectional_A-Star.py
LICENSE		LICENSE
README.md		README.md

Repository files navigation

A-Star (A*) Algorithm

Several different implementations of the A-Star 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.

About

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

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

25 stars

0 watching

Report repository

Releases

Packages

Contributors

Languages

Back | FazBrowse Home | New Git URL