An implementation of Hierholzer's algorithm for finding an eulerian path on a particular kind of graph. I had to fiind one for my discrete math class and of course I'd rather spend 30m writing/debugging this instead of doing it by hand in 5m.
-
Notifications
You must be signed in to change notification settings - Fork 0
An implementation of Hierholzer's algorithm for finding an eulerian path on a particular kind of graph. I had to fiind one for my discrete math class and of course I'd rather spend 30m writing/debugging this instead of doing it by hand in 5m.
TomiFG/eulerian-path
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
An implementation of Hierholzer's algorithm for finding an eulerian path on a particular kind of graph. I had to fiind one for my discrete math class and of course I'd rather spend 30m writing/debugging this instead of doing it by hand in 5m.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published