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クライアントから使う