Eulerian graph - shortest_all_path generator

[klaudia-nowak]

Do you plan to release shortest_all_path generator in near future? I'd like to use that kind of algorithm in the project I am currently working on. I tried with current implementation of ShortestAllPaths.java, but it does not work for me (I receive AlgorithmException). Is it other way to traverse Eulerain graph (full coverage) in GraphWalker?

[KristianKarl]

Hi,
No, there is no plan for the near future.
The issue #34 is tracking the feature I think you are asking for. But it has not yet started.