FindPostmanTour

Available

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

Forms

FindPostmanTour[g]

FindPostmanTour[g, k]

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

Verified examplesFindPostmanTour[g]//First → g route = First[FindPostmanTour[g]] → g Shallow[tour = First[FindPostmanTour[g]]] → Shallow[g]

Run this on Qurak Search the reference

Used in

Enhanced cycle and tour functionality - 8 steps

Topics

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 »

Related

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

All 6300 functions · Use this from an MCP client