Hello everyone, I’m new to using this library, but I have a big problem. I have a cartographic base in shapefile format of some highways and I need to find a shortest path that visits each edge, my problem fits in the algorithm of the Chinese postman. I would like to know if someone has already developed a similar work and how to run the Chinese postman on a georeferenced basis.
The postman tour is not yet implemented in igraph. Feel free to open a feature request, but if you do so, please research available algorithms first, and include your findings in the feature request, along with references.
In case your graph is Eulerian, igraph already has functions for Eulerian paths and cycles.