Buy Me a Coffee at ko-fi.com

Route inspection problem

in graph theory, the problem to find a shortest closed path or circuit that visits every edge of an undirected graph

Pronunciation
/raʊt ɪnˈspɛkʃən ˈprɑbləm/
/ruːt ɪnˈspɛkʃn ˈprɒbləm/