FindPostmanTour

Доступно

Find a shortest closed walk traversing every edge (Chinese postman)

Формы

FindPostmanTour[g]

FindPostmanTour[g, k]

FindPostmanTour[{v -> w, …}, …]

Проверенные примерыFindPostmanTour[g]//First → g route = First[FindPostmanTour[g]] → g Shallow[tour = First[FindPostmanTour[g]]] → Shallow[g]

Выполнить на Qurak Поиск по справочнику

Используется в

Enhanced cycle and tour functionality - 8 шагов

Темы

Computation On Graphs - Paths, Cycles, and Flows »
Graph Paths Cycles And Flows - Cycles and Tours
New In90 Alphabetical Listing - F
New In90 Mathematics And Algorithms - Graphs & Networks »

Связанное

FindEulerianCycle FindHamiltonianCycle FindShortestTour FindHamiltonianPath FindMaximumFlow EdgeConnectivity EulerianGraphQ FailureDistribution FindCycle FindFundamentalCycles FindMinimumCostFlow FindShortestPath

Все 6300 функций · Использовать из MCP-клиента