Hi I was wondering if there is an inbuilt routine in the nauty libraries with which I can solve the Chinese Postman Problem (or extract the Eulerian path) for any input undirected graph? I could not find any such function in the user guide. Thanks in advance, Vipin