Optimal Routing and Cost Allocation for the Chinese Postman Game R package CoopPostman version 0.1.0 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. Software Imports: igraph, graphics Suggests: ggplot2 Maria Gabriela Perez <maria.g.perezs@udc.es> Comprehensive R Archive Network (CRAN) Maria Gabriela Perez [aut, cre] GPL (>= 3) 2026-10-15 application/tgz https://CRAN.R-project.org/package=CoopPostman doi:10.32614/CRAN.package.CoopPostman