Rosalind - Fleury's Algorithm - Eulerian Path and Eulerian Cycle29 May 2016
This was an implementation problem and hence I will not be discussing the logic used. This is a very good explanation about this algorithm. It applies to both the algorithms - to find an eulerian path and eulerian circuit.
The only place where they differ are the choice of the starting node.
- Eulerian Cycle: The choice of start node does not matter.
- Eulerian Path: The start node must be that node which has an outdegree that is one greater than its indegree.