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.

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

Fallback implementation for shortest path between two nodes when GDS is not available #272

Open
CatoLeanTruetschel opened this issue Jun 7, 2021 · 0 comments
Labels
Milestone

Comments

@CatoLeanTruetschel
Copy link
Collaborator

Fallback implementation for shortest path between two nodes when GDS is not available. This can be a slow in-memory implementation as this is only a fallback. The detection whether GDS is available shall be done dynamically via requesting the database, without any configuration needed. The choice can be overriden via configuration.

Therefore possible config settings are:

  • Auto
  • In-memory
  • Database-native

An exception will be thrown if the configuration sepcified database-native and the GDS plugin is not available.

@CatoLeanTruetschel CatoLeanTruetschel added this to the Sprint 8 milestone Jun 7, 2021
@derwehr derwehr modified the milestones: Sprint 8, Sprint 9 Jun 9, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

2 participants