Add methods for minimal path calculation making use of UBODT #248
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
… not been calculated
…path on UBODT::look_bfs_le_path()
|
Thanks for your work! Good |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
It is more like a request for comment rather than a proper pull request. UBODT (or simply ODT data structure) has interesting properties that can be used for generating a set of shortest paths, which are very useful when modelling route choice using any discrete choice framework Prato, 2009.
Since route choice modelling usually comprises both map matching and route choice generation Menghini et al. 2010, reusing the same preexisting ODT entries to reduce processing time may benefit.
This code has been tested, but hasn't been benchmarked