Verify non-deterministic iterators

NREL / routee-compass

The RouteE-Compass energy-aware routing engine

https://nrel.github.io/routee-compass/

BSD 3-Clause "New" or "Revised" License

9 stars 4 forks source link

Verify non-deterministic iterators #196

Open robfitzgerald opened 2 months ago

robfitzgerald commented 2 months ago

We are seeing that some queries with similar start locations are assigned different graph ids. this implies that the distance metrics for the rtrees (vertex rtree, edge rtree) may need deterministic tie-breakers.

Similarly, we should review iterators to confirm all have deterministic tie-breakers:

graph iterators
a* queue

robfitzgerald commented 2 months ago

It doesn't look like rstar supports tiebreakers for the distance function used in nearest neighbors link