We have a store, check it out!

  • Delivery to Europe and the US!
  • Follow us on Twitter to be notified when we add more countries and designs!
  • Any wishes or feedback? Get in touch! :)

Permanent link: idea-instructions.com/euler-path/

This page describes Fleury’s algorithm, an elegant method to find an Eulerian path in a graph – a path which visits every edge exactly once.

Initially published 2017-11-08.