Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Verify non-deterministic iterators #196

Open
robfitzgerald opened this issue Apr 30, 2024 · 1 comment
Open

Verify non-deterministic iterators #196

robfitzgerald opened this issue Apr 30, 2024 · 1 comment
Labels
rust Applies to the rust code
Milestone
National Runs

Comments

@robfitzgerald
Copy link
Collaborator

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 robfitzgerald added this to the National Runs milestone Apr 30, 2024
@robfitzgerald
Copy link
Collaborator Author

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

@robfitzgerald robfitzgerald added the rust Applies to the rust code label May 10, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
rust Applies to the rust code
Projects
None yet
Milestone
National Runs
Development

No branches or pull requests
1 participant
@robfitzgerald