Calculate Path cover graph chinese postman problem software tool

I am searching a software which is able to calculate the possible paths to cover a graph and if possible find the shortest one.

Hello Graphviz Forum, I am seraching a tool which is able to calculate the possible routes to cover a graph like the one shown at the end of this blog: http://got-bugs.blogspot.de/2009/04/model-based-testing-howto-part-3.html This is somehow related to the chinese postman problem, which is very well explained in this Video: http://www.youtube.com/watch?v=spaUY8PlyYA There is however one difference which is that there are no long or short edges. The aim is to walk along each node and edge at least once. Is someone aware of a software which is able to calculate the possible paths?

Recent comments

Syndicate content