Eulerian Circuit
1 problems
An Eulerian circuit visits every edge exactly once. It exists in a directed graph iff every node has equal in-degree and out-degree, and the graph is connected. Hierholzer's algorithm finds it in O(E). Applications: DNA assembly and route planning.