# ------------------------------------------------
# CITATION.cff file created with {cffr} R package
# See also: https://docs.ropensci.org/cffr/
# ------------------------------------------------
 
cff-version: 1.2.0
message: 'To cite package "CoopPostman" in publications use:'
type: software
license: GPL-3.0-or-later
title: 'CoopPostman: Optimal Routing and Cost Allocation for the Chinese Postman Game'
version: 0.1.0
abstract: 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:
- family-names: Perez
  given-names: Maria Gabriela
  email: maria.g.perezs@udc.es
repository: https://cran.r-universe.dev
commit: d9f39d87e030ab3f3bb4209c97461df5b8d4c82d
date-released: '2026-10-15'
contact:
- family-names: Perez
  given-names: Maria Gabriela
  email: maria.g.perezs@udc.es