Chinese postman problemChinese postman problem
Uncommon
Rarity: Uncommon
A topic a little better known than average, read and translated beyond its own country.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
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.
Excerpt from the Wikipedia article “Chinese postman problem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Image: Cmglee, CC BY-SA 4.0, via Wikimedia Commons.
Open free boosters and add Chinese postman problem to your collection.
Play for free




