Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
A* Search / Pathfinding Algorithm in Javascript
JavaScript CSS HTML

Fetching latest commit…

Cannot retrieve the latest commit at this time

Failed to load latest commit information.
benchmark
demo
dist
docs
original-implementation
test
LICENSE
README.md
Rakefile
astar.js
graph.js
index.html

README.md

javascript-astar

An implementation of the A* Search Algorithm in JavaScript

See a demo at http://www.briangrinstead.com/files/astar/

astar.js

The newest version of the algorithm using a Binary Heap. It is quite faster than the original. http://www.briangrinstead.com/blog/astar-search-algorithm-in-javascript-updated Binary Heap taken from http://eloquentjavascript.net/appendix2.html (license: http://creativecommons.org/licenses/by/3.0/)

original-implementation/astar-list.js:

The original version of the algorithm based off the original blog post at: http://www.briangrinstead.com/blog/astar-search-algorithm-in-javascript I left it in because it may be a little easier for some people to understand, but if you are planning on actually using this, I would strongly recommend using astar.js instead.

Sample Usage

If you want just the A* search code (not the demo visualization), use code like this (http://gist.github.com/581352):

<script type='text/javascript' src='graph.js'></script>
<script type='text/javascript' src='astar.js'></script>
<script type='text/javascript'>
    var graph = new Graph([
        [0,0,0,0],
        [1,0,0,1],
        [1,1,0,0]
    ]);
    var start = graph.nodes[0][0];
    var end = graph.nodes[1][2];
    var result = astar.search(graph.nodes, start, end);
    // result is an array containing the shortest path
</script>
Something went wrong with that request. Please try again.