Re-add support for optimising paths with independent points #5
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
Previously, the point graph construction would optimise out edges whose source and target represented the same node. This PR re-adds support for loop edges with the condition that they represent a single point surrounded by blanks. The euler graph construction has been updated to account for this by ignoring loop edges when determining the degree of a node.
mitchmindtree
added a commit
to mitchmindtree/lasy
that referenced
this pull request
May 15, 2020
Features: - Improved euler circuit interpolation. nannou-org#2. - Support for independent points. nannou-org#5.
Merged
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.
Previously, the point graph construction would optimise out edges whose
source and target represented the same node. This PR re-adds support for
loop edges with the condition that they represent a single point
surrounded by blanks. The euler graph construction has been updated to
account for this by ignoring loop edges when determining the degree of a
node.
Closes #1.