 |
BUILT-IN MATHEMATICA SYMBOL
FindPostmanTour
FindPostmanTour[g]
finds a Chinese postman tour in the graph g of minimal length.
FindPostmanTour[g, k]
finds at most k Chinese postman tours.
Details
- A Chinese postman tour is a tour that traverses each edge at least once.
- FindPostmanTour returns a list of edges consisting of Chinese postman tours.
- FindPostmanTour returns the list
if no Chinese postman tours exist. - FindPostmanTour[g] is equivalent to FindPostmanTour[g, 1].
New in 9
