Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add Eulerian Path algorithm #106

Closed
ZigRazor opened this issue Oct 15, 2021 · 0 comments · Fixed by #138
Closed

Add Eulerian Path algorithm #106

ZigRazor opened this issue Oct 15, 2021 · 0 comments · Fixed by #138
Assignees
Labels
core something about core development Development of new Functionalities enhancement New feature or request good first issue Good for newcomers hacktoberfest hacktoberfest issue Priority:Medium Priority Label for medium priority issue

Comments

@ZigRazor
Copy link
Owner

Eulerian Path is a path in graph that visits every edge exactly once.
Eulerian Circuit is an Eulerian Path which starts and ends on the same vertex.
time complexity is O(V+E)
space complexity is O(VE)

@ZigRazor ZigRazor added enhancement New feature or request good first issue Good for newcomers development Development of new Functionalities core something about core Priority:Medium Priority Label for medium priority issue hacktoberfest hacktoberfest issue labels Oct 15, 2021
@ZigRazor ZigRazor added this to the Algorithm Implementation milestone Oct 15, 2021
@sidml sidml self-assigned this Oct 20, 2021
@sidml sidml mentioned this issue Oct 20, 2021
ZigRazor pushed a commit that referenced this issue Oct 20, 2021
* eulerian path using hierholzers algorithm

* eulerian path test

* update cmake
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
core something about core development Development of new Functionalities enhancement New feature or request good first issue Good for newcomers hacktoberfest hacktoberfest issue Priority:Medium Priority Label for medium priority issue
Projects
None yet
Development

Successfully merging a pull request may close this issue.

2 participants