Re: Do you have a benchmark test for Astar algorithm?

[Yoann Pigné <yoann.pigne AT gmail.com>]

Hi Baohua, 

1. No benchmark on A*, but be advised that this implementation of A* is 
generic. The  « heuristic »  and « cost »  procedures default to a classical 
Dijkstra-like implementation. You will have to provide custom evaluation 
functions if you want a spacial behavior. See the « Costs »  interface for 
more details : 
https://data.graphstream-project.org/api/gs-algo/1.3/org/graphstream/algorithm/AStar.Costs.html

2. The « open »  and « close »  maps use classical java HashMaps for now. 

Regards,
Yoann


> On Jan 22, 2016, at 4:34 AM, 
> wangbaohua2009 AT 163.com
>  wrote:
> 
> Dearest authors,
> firstly thank you for your work. So I can have a easy-to-use package to do
> graph jobs.
> As regard to A*, I have 2 questions:
> 1 do you have a benchmark test result?
> 2 do you use binary heap to improve efficiency? I see a FibonacciHeap class
> there
> Thx.
> baohua