My favorites | Sign in
Project Home Downloads Issues Source
New issue   Search
for
  Advanced search   Search tips   Subscriptions
Issue 1: Add the A* algo to path finding
2 people starred this issue and may be notified of changes. Back to list
Status:  New
Owner:  ----


Sign in to add a comment
 
Reported by neubauer...@gmail.com, Mar 19, 2010
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
Mar 19, 2010
Project Member #1 nguyenminh2@gmail.com
(No comment was entered for this change.)
Labels: -Type-Defect Type-Enhancement
Mar 20, 2010
#2 neubauer...@gmail.com
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
Mar 20, 2010
Project Member #3 nguyenminh2@gmail.com
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.
May 26, 2010
#4 neubauer...@gmail.com
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?
Sign in to add a comment

Powered by Google Project Hosting