Optimal Routing and Cost Allocation for the Chinese Postman Game
![[R logo]](../../../doc/html/Rlogo.svg)
![[Up]](../../../doc/html/left.jpg)
![[Top]](../../../doc/html/up.jpg)
Documentation for package ‘CoopPostman’ version 0.1.0
Help Pages
| calcular_gamma | Cooperative Gamma-Rule Cost Allocation (Hamers et al., 1999) |
| duplicate_shortest_path | Duplicate Shortest Path Edges in the Graph |
| fleury_path | Fleury's Algorithm for Eulerian Circuit Generation |
| get_dijkstra_matrix | Shortest Path Distance Matrix for Odd Vertices |
| get_optimal_matching | Minimum Weight Perfect Matching via Edmonds' Blossom Algorithm |
| odd_vertices | Identify Odd Degree Vertices |
| plot_matching | Visualize Complete Distance Graph and Blossom Matching |
| solve_cpp | Solve the Chinese Postman Problem (CPP) |