Back
Add Comment
Topics
Vote
Results
route inspection problem
in graph theory, the problem to find a shortest closed path or circuit that visits every edge of an undirected graph
--Agreed Upon Solutions

The discussion does not exist would you like to add the first comment?

anonymous