Open GoogleCodeExporter opened 9 years ago
I've implemented a basic benchmark tool in a branch, interestingly I'm getting
slightly better performance out of my new digraph (a.k.a. dict_digraph) than the
digraph-classic:
Average test time for dict-digraph is 27.04
Average test time for digraph is 29.47
The test makes a graph order 500, edges 5000, and then does a bunch of a*
searches
from 10 random points to ten other random points. I'm going to set it running
tonight
with a graph ten times as big.
Original comment by salimfadhley@gmail.com
on 18 Nov 2009 at 1:11
Very cool! Two questions for you, Salim:
1. Can we have stats about other algorithms?
2. Is it possible to have dict-graph and not only dict-digraph?
Original comment by pmatiello
on 18 Nov 2009 at 1:50
In your stats, it'd be good to see the standard deviation on the numbers (since
you're doing random start / end points).
Original comment by christian.muise
on 18 Nov 2009 at 3:03
Original comment by pmatiello
on 20 Mar 2010 at 10:23
Original issue reported on code.google.com by
salimfadhley@gmail.com
on 17 Nov 2009 at 10:11