GraphMatch fix #9
Open
Conversation
This file contains hidden or 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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
Some subgraphs are being incorrectly flagged as isomorphic in GraphMatch. This is due to the fact that checking that all edges are individually isomorphic between two graphs is not a sufficient condition in GraphMatch. The code in the commit PR maintains a map of vertices throughout GraphMatch to address the issue.
I have example failing tests on the failed-tests branch of the fork (the commands run are in failed-tests.txt and the bad outputs are at tris.txt and hexes.txt).
Corrected outputs are on the passed-tests branch on the fork.