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

Enabling multi-threading when computing a series of shortest paths #167

Open
pedrocamargo opened this issue Sep 3, 2020 · 0 comments
Open
Labels
enhancement New feature or request

Comments

@pedrocamargo
Copy link
Contributor

Purpose of use
Several uses require the reporting of large numbers of full path trees at once: TNC dispatching, GPS map-matching, Full connectivity tests, etc.

Is your feature request related to a problem? Please describe.
Testing full connectivity on Polaris' networks

Describe the solution you'd like
An object similar to PathResults() but applied to an arbitrary number of ODs

Describe alternatives you've considered
Simple use of Python's threading (considering the release of the GIL by AequilibraE's path computation engine)

@pedrocamargo pedrocamargo added the enhancement New feature or request label Sep 3, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant