Allow detecting nodes with degree 4 that should still be simplified #557
Comments
7 tasks
7 tasks
sahand-asgarpour
added a commit
that referenced
this issue
Sep 16, 2024
…ed (#560) ## Issue addressed Solves #557 ## Code of conduct - [x] I HAVE NOT added sensitive or compromised (test) data to the repository. - [x] I HAVE NOT added vulnerabilities to the repository. - [x] I HAVE discussed my solution with (other) members of the RA2CE team. ## What has been done? Explain how you addressed the resolution of the related issue, what choices you made and why. ### Checklist - [ ] Code is formatted using our custom `black` and `isort` definitions. - [x] Tests are either added or updated. - [x] Branch is up to date with `master`. - [x] Updated documentation if needed. ## Additional Notes (optional) Add any additional notes or information that may be helpful.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Kind of request
Adding new functionality
Enhancement Description
graph_complex.edges = [(0,1), (1,2), (1, 0), (2, 1)] => graph_simplified.edges = [(0, 2), (2, 0)]
Right now it graph_simplified.edges = [(0,1), (1,2), (1, 0), (2, 1)]
So we should allow detecting nodes with degree 4 that should still be simplified. Right now nodes with degree 2 will be detected for simplification which misses the cases explained above.
Use case
No response
Additional Context
No response
The text was updated successfully, but these errors were encountered: