Add Eulerian trail search algorithm #2556
Merged
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.
This pull request adds Hierholzer's algorithm as proposed in issue #2186 (recently closed, presumably due to inactivity). In particular, it can find Eulerian trails and cycles in both directed and undirected multigraphs should they exist.
For the sake of transparency, it should be known that I am new to the PR game and as such am anticipating potentially extensive feedback for this contribution, although I've attempted to do my due diligence.