Add the A* algo to path finding

[GoogleCodeExporter]

you might want to add the A* algo to the book on least cost path finding, 
especially i geo-scenarios, http://en.wikipedia.org/wiki/A*.

Dijkstra is a special case of A* so it should fit well ...

/peter

Original issue reported on code.google.com by neubauer...@gmail.com on 19 Mar 2010 at 1:17

[GoogleCodeExporter]

Original comment by nguyenminh2@gmail.com on 19 Mar 2010 at 1:50

• Added labels: Type-Enhancement
• Removed labels: Type-Defect

[GoogleCodeExporter]

Btw, would you be interested in having www.neo4j.org providing running test 
cases for 
some of these algos? We are doing that anyway as part of the graph algo package 
with 
benchmarking, http://components.neo4j.org/neo4j-graph-algo/

Cheers

/peter

Original comment by neubauer...@gmail.com on 20 Mar 2010 at 3:45

[GoogleCodeExporter]

neubauer.peter:
> Btw, would you be interested in having www.neo4j.org providing running test
> cases for some of these algos?

That sounds interesting. But I have to admit that I don't know how to go about 
doing
that.

Original comment by nguyenminh2@gmail.com on 21 Mar 2010 at 4:00

[GoogleCodeExporter]

Well, we could maybe have a GIThub repo, or an exmples section here, that 
contains 
example code in Neo4j dealing with some algos so people can see load example 
datasets and play around with them?

Original comment by neubauer...@gmail.com on 26 May 2010 at 9:56