{ "_id": "6ad139840edca5be25021a1b", "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\",\nfamily = \"Perez\",\nrole = c(\"aut\", \"cre\"),\nemail = \"maria.g.perezs@udc.es\")", "Description": "Solves the Chinese Postman Problem (CPP) using Dijkstra's\nalgorithm for shortest paths, Edmonds' Blossom algorithm (1965)\nfor minimum weight perfect matching, and Fleury's algorithm for\nEulerian circuit generation. Additionally, computes the\ncooperative gamma-rule cost allocation proposed by Hamers,\nKlijn, Suijs, and Tijs (1999) for weakly Eulerian networks.", "License": "GPL (>= 3)", "Encoding": "UTF-8", "RoxygenNote": "7.3.3", "NeedsCompilation": "no", "Packaged": { "Date": "2026-10-15 20:34:00 UTC", "User": "root" }, "Author": "Maria Gabriela Perez [aut, cre]", "Maintainer": "Maria Gabriela Perez ", "Repository": "https://cran.r-universe.dev", "Date/Publication": "2026-10-15 17:10:16 UTC", "RemoteUrl": "https://github.com/cran/CoopPostman", "RemoteRef": "HEAD", "RemoteSha": "d9f39d87e030ab3f3bb4209c97461df5b8d4c82d", "_user": "cran", "_type": "src", "_file": "CoopPostman_0.1.0.tar.gz", "_fileid": "https://r2.ropensci.org/f069f3f01724411abeccf6c65578ec61b75ffa50434a1d01c6155cc860840d16", "_filesize": 93973, "_sha256": "f069f3f01724411abeccf6c65578ec61b75ffa50434a1d01c6155cc860840d16", "_expires": "2027-01-23T20:37:21.000Z", "_created": "2026-10-15T20:34:00.000Z", "_published": "2026-10-15T20:37:24.383Z", "_buildurl": "https://github.com/r-universe/cran/actions/runs/38802657265", "_status": "success", "_host": "GitHub-Actions", "_jobs": [ { "job": 116656685086, "time": 102, "config": "linux-devel-x86_64", "r": "4.7.0", "check": "OK", "artifact": "12004179481" }, { "job": 116656685084, "time": 103, "config": "linux-release-x86_64", "r": "4.6.1", "check": "OK", "artifact": "12004299165" }, { "job": 116655609731, "time": 135, "config": "source", "r": "4.6.1", "check": "OK", "artifact": "12005830759" }, { "job": 116656685131, "time": 93, "config": "wasm-release", "r": "4.6.0", "check": "OK", "artifact": "12005780889" }, { "job": 116656685174, "time": 87, "config": "windows-devel-x86_64", "r": "4.7.0", "check": "OK", "artifact": "12004808420" }, { "job": 116656685236, "time": 163, "config": "windows-release-x86_64", "r": "4.6.1", "check": "OK", "artifact": "12004169521" } ], "_upstream": "https://github.com/cran/CoopPostman", "_commit": { "id": "d9f39d87e030ab3f3bb4209c97461df5b8d4c82d", "author": "Maria Gabriela Perez ", "committer": "cran-robot ", "message": "version 0.1.0\n", "time": 1792084216 }, "_maintainer": { "name": "Maria Gabriela Perez", "email": "maria.g.perezs@udc.es" }, "_distro": "resolute", "_registered": true, "_dependencies": [ { "package": "igraph", "role": "Imports" }, { "package": "graphics", "role": "Imports" }, { "package": "ggplot2", "role": "Suggests" } ], "_owner": "cran", "_selfowned": false, "_usedby": 0, "_updates": [ { "week": "2026-42", "n": 1 } ], "_tags": [ { "name": "0.1.0", "date": "2026-10-15" } ], "_stars": 0, "_userbio": { "uuid": 6899542, "type": "organization", "name": "cran", "followers": 631, "description": "Unofficial read-only mirror of all CRAN R packages" }, "_downloads": { "count": 0, "source": "https://cranlogs.r-pkg.org/downloads/total/last-month/CoopPostman" }, "_searchresults": 0, "_rbuild": "4.6.1", "_assets": [ "extra/citation.cff", "extra/citation.html", "extra/citation.json", "extra/citation.txt", "extra/contents.json", "extra/CoopPostman.html", "extra/manual.pdf" ], "_cranurl": false, "_releases": [ { "version": "0.1.0", "date": "2026-10-15" } ], "_exports": [ "calcular_gamma", "duplicate_shortest_path", "fleury_path", "get_dijkstra_matrix", "get_optimal_matching", "odd_vertices", "plot_matching", "solve_cpp" ], "_help": [ { "page": "calcular_gamma", "title": "Cooperative Gamma-Rule Cost Allocation (Hamers et al., 1999)", "topics": [ "calcular_gamma" ] }, { "page": "duplicate_shortest_path", "title": "Duplicate Shortest Path Edges in the Graph", "topics": [ "duplicate_shortest_path" ] }, { "page": "fleury_path", "title": "Fleury's Algorithm for Eulerian Circuit Generation", "topics": [ "fleury_path" ] }, { "page": "get_dijkstra_matrix", "title": "Shortest Path Distance Matrix for Odd Vertices", "topics": [ "get_dijkstra_matrix" ] }, { "page": "get_optimal_matching", "title": "Minimum Weight Perfect Matching via Edmonds' Blossom Algorithm", "topics": [ "get_optimal_matching" ] }, { "page": "odd_vertices", "title": "Identify Odd Degree Vertices", "topics": [ "odd_vertices" ] }, { "page": "plot_matching", "title": "Visualize Complete Distance Graph and Blossom Matching", "topics": [ "plot_matching" ] }, { "page": "solve_cpp", "title": "Solve the Chinese Postman Problem (CPP)", "topics": [ "solve_cpp" ] } ], "_rundeps": [ "cli", "cpp11", "glue", "igraph", "lattice", "lifecycle", "magrittr", "Matrix", "pkgconfig", "rlang", "vctrs" ], "_score": 1, "_indexed": true, "_nocasepkg": "cooppostman", "_universes": [ "cran" ], "_binaries": [ { "r": "4.7.0", "os": "linux", "version": "0.1.0", "date": "2026-10-15T20:35:47.000Z", "distro": "resolute", "commit": "d9f39d87e030ab3f3bb4209c97461df5b8d4c82d", "fileid": "https://r2.ropensci.org/7b06271c8d5bd8062ec9f2d4bcfbb334e0b78c9ea0ee40b3e899e4ae78088f4b", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/cran/actions/runs/38802657265" }, { "r": "4.6.1", "os": "linux", "version": "0.1.0", "date": "2026-10-15T20:35:50.000Z", "distro": "resolute", "commit": "d9f39d87e030ab3f3bb4209c97461df5b8d4c82d", "fileid": "https://r2.ropensci.org/b47e59477a1d1a3248da25466d2312a6b44880759454e68939b667cc6c454291", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/cran/actions/runs/38802657265" }, { "r": "4.6.0", "os": "wasm", "version": "0.1.0", "date": "2026-10-15T20:35:48.000Z", "commit": "d9f39d87e030ab3f3bb4209c97461df5b8d4c82d", "fileid": "https://r2.ropensci.org/78cb3d6b6fb075aec846332ff33e036fb3274e7feaf6506a9f1cd9d815888278", "status": "success", "buildurl": "https://github.com/r-universe/cran/actions/runs/38802657265" }, { "r": "4.7.0", "os": "win", "version": "0.1.0", "date": "2026-10-15T20:35:26.000Z", "commit": "d9f39d87e030ab3f3bb4209c97461df5b8d4c82d", "fileid": "https://r2.ropensci.org/c5d405d2aa5346bd5a2d9a0e3e12bbde62d58a4404762b36c5012c51e08d0ba8", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/cran/actions/runs/38802657265" }, { "r": "4.6.1", "os": "win", "version": "0.1.0", "date": "2026-10-15T20:36:44.000Z", "commit": "d9f39d87e030ab3f3bb4209c97461df5b8d4c82d", "fileid": "https://r2.ropensci.org/9e7fc2eb7aaf928fe4c32651fcd019f3a7f6a7c81c27971e8cc7f29e81936cc9", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/cran/actions/runs/38802657265" } ] }