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

[edit]
Language Code Linked page
čeština cswiki
Deutsch dewiki
English enwiki
español eswiki
euskara euwiki
français frwiki
עברית hewiki
magyar huwiki
italiano itwiki
日本語 jawiki
Nederlands nlwiki
polski plwiki
português ptwiki
Simple English simplewiki
українська ukwiki
Tiếng Việt viwiki
中文 zhwiki
[edit]
[edit]
[edit]
[edit]
[edit]