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

Test if a tree like search for shortest trips to all known locations is feasible #117

Open
3 tasks
EricKolibacz opened this issue Feb 17, 2023 · 0 comments
Open
3 tasks

Test if a tree like search for shortest trips to all known locations is feasible #117

EricKolibacz opened this issue Feb 17, 2023 · 0 comments
Labels
enhancement New feature or request

Comments

@EricKolibacz
Copy link
Owner

The idea would be to take all known locations with their known trips (where these locations are origins (or maybe destinations too?)) and so on. Then take the shortest (by time) trips from the given location to all known locations. Queried trips will always have priority.

  • Save all stopovers into db
  • compute described tree
  • return locations
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@EricKolibacz