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