Chinese Postman or Route Inspection | Set 1 (introduction) - GeeksforGeeks

Chinese Postman or Route Inspection | Set 1 (introduction) - GeeksforGeeks

Chinese Postman Problem is a variation of Eulerian circuit problem for undirected graphs. An Euler Circuit is a closed walk that covers every edge once starting and ending position is same. Chiniese Postman problem is defined for connected and undirected graph. The problem is to find shortest path or circuity that visits every edge of the graph at least once.

Read full article from Chinese Postman or Route Inspection | Set 1 (introduction) - GeeksforGeeks