eulerian_path (252B)
1 # Eulerian path 2 3 A [path] that visits every [edge] of a [graph] exactly once 4 5 Can be defined for [graph_directed] or [graph_undirected] 6 7 [Decision_problem]: [Eulerian_path_decision] 8 9 Variants: 10 - [eulerian_cycle] 11 - [chinese_postman_problem] 12 13 Up: [path]