Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Non-recursive implementation for finding euler tour using adjacency list#1472

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 ourterms of service andprivacy statement. We’ll occasionally send you account related emails.

Already on GitHub?Sign in to your account

Closed
rhombus2002 wants to merge3 commits intocp-algorithms:mainfromrhombus2002:patch-1

Conversation

@rhombus2002
Copy link

No description provided.

@rhombus2002rhombus2002 changed the titleRecursive implementation for finding euler tour using adjacency listNon-recursive implementation for finding euler tour using adjacency listJun 27, 2025
@mhayter
Copy link
Contributor

mhayter commentedJun 28, 2025•
edited
Loading

The original article is weak as it doesn't show the faster adjacency list implementation. This improvement is needed. I learned the recursive implementation elsewhere, so this is a useful improvement.

Has this been tested on any sample problems?

Sign up for freeto join this conversation on GitHub. Already have an account?Sign in to comment

Reviewers

No reviews

Assignees

No one assigned

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

2 participants

@rhombus2002@mhayter
[8]ページ先頭
©2009-2025 Movatter.jp