# route inspection problem

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

**Wikidata**: [Q901096](https://www.wikidata.org/wiki/Q901096)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Chinese_postman_problem)  
**Source**: https://4ort.xyz/entity/route-inspection-problem


## References

1. Freebase Data Dumps. 2013
2. Matching, Euler tours and the Chinese postman. 1973