Package: CoopPostman
Type: Package
Title: Optimal Routing and Cost Allocation for the Chinese Postman Game
Version: 0.1.0
Authors@R: 
    person(given = "Maria Gabriela",
           family = "Perez",
           role = c("aut", "cre"),
           email = "maria.g.perezs@udc.es")
Description: 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.
License: GPL (>= 3)
Encoding: UTF-8
RoxygenNote: 7.3.3
Imports: igraph, graphics
Suggests: ggplot2
NeedsCompilation: no
Packaged: 2026-10-05 12:24:58 UTC; gabri
Author: Maria Gabriela Perez [aut, cre]
Maintainer: Maria Gabriela Perez <maria.g.perezs@udc.es>
Repository: CRAN
Date/Publication: 2026-10-15 17:10:16 UTC
