Graph Algorithms Fleury’s Algorithm: Finding Eulerian tours in a graph Fleury's algorithm is a simple algorithm for finding Eulerian paths or tours. It proceeds by repeatedly removing edges from the graph in such way, that the graph remains Eulerian.
