graphserver
graphserver copied to clipboard
Contraction heirarchies should stop a a common meeting point
From David Turner:
I think one of them was that the CH query code did a full dijkstra on the up and down graphs rather than stopping once it there is some meeting point that is optimal.
From BMA: That was just lazyness on my part. The improvement would result in a constant factor speedup, more or less.