Eulerian circuit
Материал из WikiGrapp
Eulerian circuit --- эйлеров цикл.
An Eulerian circuit of a connected graph [math]\displaystyle{ G }[/math] is a circuit (cycle) that traverses each edge of [math]\displaystyle{ G }[/math] exactly once, although it may visit a vertex more than once.
