I need to find a Chinese postman circuit in a bidirected graph. Bidirected graph here is not the symmetric directed graph, but the graph introduced by Edmonds & Johnson in 1970.
I found few papers that solved similar problem based on a paper published by Harold N Gabow in i983, but there was no formalized algorithm; they just mentioned that the problem can be reduced/related to perfect b-matching, bidirected network flow.. and so on, which i cannot understand so far.
if anyone know the concept and algorithm for that, please give me some advise.
