I need help with creating a Python script for the Chinese Postman Problem

Hello all,
I need help with the Chinese Postman Problem. I have a series of edges in a graph, I need to find the most efficient path through ALL of these edges. I attempted to install the NetworkX module but have not had success and don’t have the time to troubleshoot. If you wish to use a different method, that is fine as long as I can run it as well.

Here are some forum topics discussing this:

Looking forward to speaking with you!