Skip to content

Approximative solution based on Hierholzer's algorithm - #26

Open
Krho wants to merge 2 commits into
Optiways:masterfrom
Krho:master
Open

Approximative solution based on Hierholzer's algorithm#26
Krho wants to merge 2 commits into
Optiways:masterfrom
Krho:master

Conversation

@Krho

@Krho Krho commented Mar 23, 2026

Copy link
Copy Markdown

This PR proposes a solution that :

  • use (a naive version of) Hierholzer's algorithm to find the min-weight path in Eulerian graphs
  • use a very naive method to "add" edges to make a graph Eulerian
  • add some methods on graph module

More explanations and discussions on solver/solution.md :)

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

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant