FindPostmanTour

Tilgjengelig

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

Former

FindPostmanTour[g]

FindPostmanTour[g, k]

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

Verifiserte eksemplerFindPostmanTour[g]//First → g route = First[FindPostmanTour[g]] → g Shallow[tour = First[FindPostmanTour[g]]] → Shallow[g]

Kjør dette på Qurak Søk i referansen

Brukt i

Enhanced cycle and tour functionality - 8 steg

Emner

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 »

Relatert

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

Alle 6300 funksjoner · Bruk dette fra en MCP-klient