{"version":"1.0","type":"link","title":"Chinese postman problem - Newikis","description":"In graph theory and combinatorial optimization, Guan's route problem, the Chinese postman problem, postman tour or route inspection problem is to find a shortest closed path or circuit that visits every edge of an (connected) undirected graph at least once. When the graph has an Eulerian circuit (a…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/7/7e/Chinese_postman_problem.svg/1280px-Chinese_postman_problem.svg.png","thumbnail_width":1280,"thumbnail_height":960}