Reached à la Trip-based #134
Draft
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
# Conflicts: # include/nigiri/routing/raptor/raptor.h # include/nigiri/routing/raptor/raptor_state.h
# Conflicts: # include/nigiri/routing/raptor/raptor.h # include/nigiri/routing/raptor/raptor_state.h # src/routing/raptor/raptor_state.cc
|
Some VIA test cases do not work yet |
felixguendling
force-pushed
the
master
branch
3 times, most recently
from
47cacd1
to
42de12a
Compare
felixguendling
force-pushed
the
master
branch
from
ed2bfcc
to
3b66452
Compare
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.
For each route$r$ maintain a Pareto set of tuples $(t, s, k) \in T \times \mathbb{N} \times \mathbb{N}$ where $T$ is the set of sorted transport indices, i.e., the difference in the day index is stored in the most significant bits of the transport index, $s$ is the stop index and $k$ is the round of the RAPTOR algorithm.