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 用戶端使用這個