FindPostmanTour

Tersedia

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

Bentuk

FindPostmanTour[g]

FindPostmanTour[g, k]

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

Contoh terverifikasiFindPostmanTour[g]//First → g route = First[FindPostmanTour[g]] → g Shallow[tour = First[FindPostmanTour[g]]] → Shallow[g]

Jalankan ini di Qurak Cari di referensi

Dipakai di

Enhanced cycle and tour functionality - 8 langkah

Topik

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 »

Terkait

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

Semua 6300 fungsi · Pakai ini dari klien MCP