GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — GitHub - 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.

BranchesTags
Open more actions menu

Latest commit

 

History

11 Commits
11 Commits

Folders and files

NameName
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.

Topics

a-star-algorithmbidirectional-a-star-algorithmgraph-algorithmsgraphsplanar-graphspython

Resources

Readme
MIT license
Activity

Stars

26 stars

Watchers

0 watching

Forks

3 forks
Report repository

Releases

Packages

Contributors

Languages

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.