A series of nonverbal
algorithm assembly instructions.
We have a couple of remaining mugs, shirts and posters left. If you're interested, get in touch!
Permanent link: idea-instructions.com/euler-path/
Download: PDF, PNG, SVG (notes) – License: CC by-nc-sa 4.0
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.
IDEA is a series of nonverbal algorithm assembly instructions, developed by Sándor P. Fekete and blinry. The instructions explain how various popular algorithms work, entirely without text. This also allows the instructions to be understood interculturally.
All instructions are available under Creative Commons licenses, so everyone is free to share and adapt them in noncommercial settings. We hope they will be useful in all sorts of contexts, for teachers, students, and curious people alike. Visit the about page to learn more, or download all instructions as a PDF.
