The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
Solves the Chinese Postman Problem (CPP) using Dijkstra's algorithm for shortest paths, Edmonds' Blossom algorithm (1965) for minimum weight perfect matching, and Fleury's algorithm for Eulerian circuit generation. Additionally, computes the cooperative gamma-rule cost allocation proposed by Hamers, Klijn, Suijs, and Tijs (1999) <doi :10.1016/S0377-2217(98)00346-6> for weakly Eulerian networks.
| Version: | 0.1.0 |
| Imports: | igraph, graphics |
| Suggests: | ggplot2 |
| Published: | 2026-10-15 |
| DOI: | 10.32614/CRAN.package.CoopPostman |
| Author: | Maria Gabriela Perez [aut, cre] |
| Maintainer: | Maria Gabriela Perez <maria.g.perezs at udc.es> |
| License: | GPL (≥ 3) |
| NeedsCompilation: | no |
| CRAN checks: | CoopPostman results |
| Reference manual: | CoopPostman.html , CoopPostman.pdf |
| Package source: | CoopPostman_0.1.0.tar.gz |
| Windows binaries: | r-devel: CoopPostman_0.1.0.zip, r-release: CoopPostman_0.1.0.zip, r-oldrel: CoopPostman_0.1.0.zip |
| macOS binaries: | r-release (arm64): CoopPostman_0.1.0.tgz, r-oldrel (arm64): CoopPostman_0.1.0.tgz, r-release (x86_64): CoopPostman_0.1.0.tgz, r-oldrel (x86_64): CoopPostman_0.1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=CoopPostman to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.