Q901096

From Wikidata
Jump to: navigation, search

Route inspection problem (Q901096) [edit]

In graph theory, the Chinese postman problem (CPP) or Route inspection problem, is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph [edit]

Also known as:
  • Chinese postman problem
[edit]

Statements

/m/01779b
1 reference