How to find an Eulerian Path (and Eulerian circuit) using Hierholzer's algorithm
Euler path/circuit existance: https://youtu.be/xR4sGgwtR2I
Euler path/circuit source code: https://youtu.be/QQ3jO1dKjYQ
Algorithms repository:
https://github.com/williamfiset/algorithms#graph-theory
Video slides:
https://github.com/williamfiset/Algorithms/tree/master/slides
Personal website:
http://www.williamfiset.com
===================================
Practicing for interviews? I have used, and recommend `Cracking the Coding Interview` which got me a job at Google. Link on Amazon: https://amzn.to/3cvMof5
A lot of the content on this channel is inspired by the book `Competitive Programming` by Steven Halim which I frequently use as a resource and reference. Link on Amazon: https://amzn.to/3wC2nix
