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

[Yev]

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:

Creating even valence graph / traversing all edges of a graph

@DanielPiker @AndersDeleuran I think the second half of my question, where the graph doesn’t necessarily consist of all vertices with even valence, could be viewed as the Chinese Postman Problem. It does seem like having a library like networkx could help. Anders, might you have experience with it in GH? However, It seems like many had problems trying to import the library into the python node. And in addition, numpy and scipy are needed by networkx, and I believe the former two libraries only…

Library for graph similarity?

Or how about pygorithm ? https://pygorithm.readthedocs.io/en/latest/Data_Structure.html#module-pygorithm.data_structures.graph What’s a graph?

Looking forward to speaking with you!