Not run yet
This repl has no cover image
Created on Dec 27, 2020
This work shows how to check if a graph is Eulerian and, after that, how to present an Eulerian circuit for such graph. The Hierholzer algorithm is used to perform this task.
No comments yet
to comment
This repl hasn't been forked yet. Give it some love!