Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Eulerian graph - shortest_all_path generator #259

Open
klaudia-nowak opened this issue Mar 1, 2021 · 1 comment
Open

Eulerian graph - shortest_all_path generator #259

klaudia-nowak opened this issue Mar 1, 2021 · 1 comment

Comments

@klaudia-nowak
Copy link

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
Copy link
Contributor

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.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@KristianKarl @klaudia-nowak