Package: CoopPostman 0.1.0

Maria Gabriela Perez

CoopPostman: Optimal Routing and Cost Allocation for the Chinese Postman Game

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.

Authors:Maria Gabriela Perez [aut, cre]

CoopPostman_0.1.0.tar.gz
CoopPostman_0.1.0.zip(r-4.7-any)CoopPostman_0.1.0.zip(r-4.6-any)
CoopPostman_0.1.0.tar.gz(r-4.7-any)CoopPostman_0.1.0.tar.gz(r-4.6-any)
CoopPostman_0.1.0.tgz(r-4.6-emscripten)
manual.pdf |manual.html✨
DESCRIPTION
card.svg |card.png
CoopPostman/json (API)

# Install 'CoopPostman' in R:
install.packages('CoopPostman', repos = c('https://cran.r-universe.dev', 'https://cloud.r-project.org'))

On CRAN:

Conda:

This package does not link to any Github/Gitlab/R-forge repository. No issue tracker or development information is available.

1.00 score 8 exports 11 dependencies

Last updated from:d9f39d87e0. Checks:6 OK. Indexed: yes.

TargetResultTimeFilesSyslog
linux-develOK102
source / vignettesOK135
linux-releaseOK103
windows-develOK87
windows-releaseOK163
wasm-releaseOK93

Exports:calcular_gammaduplicate_shortest_pathfleury_pathget_dijkstra_matrixget_optimal_matchingodd_verticesplot_matchingsolve_cpp

Dependencies:clicpp11glueigraphlatticelifecyclemagrittrMatrixpkgconfigrlangvctrs