Simple fixes to mapdist() #133
Open
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
Fixes cases where there are multiple destinations with the same origin address.
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.
These are simple fixes to
mapdist(), for example fixing issue #70.I am aware that a set of more advanced updates is proposed in pull request #129, and this pull request does not play well with that. However, is it desirable to change the semantics of vector origins and destinations so that all pairs of origin-destination (
from-to) are searched, as happens in #129? At present, withfrom=c("A", "B")andto=c("C", "D"), only routesA-CandB-Dare searched, but #129 also searchesA-DandB-C.