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)