eulerian_circuit (259B)
1 # Eulerian circuit 2 3 An [Eulerian_path] which is a [cycle_circuit], i.e., starts and ends at the same [vertex] 4 5 The number of Eulerian circuits in [directed_graphs] can be computed in [PTIME] by the [BEST_theorem] 6 7 Up: [eulerian_path] 8 9 Aliases: Eulerian cycle