FindPostmanTour

Disponible

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

Formas

FindPostmanTour[g]

FindPostmanTour[g, k]

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

Ejemplos verificadosFindPostmanTour[g]//First → g route = First[FindPostmanTour[g]] → g Shallow[tour = First[FindPostmanTour[g]]] → Shallow[g]

Ejecutar en Qurak Buscar en la referencia

Usada en

Enhanced cycle and tour functionality - 8 pasos

Temas

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 »

Relacionadas

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

Las 6300 funciones · Usar esto desde un cliente MCP