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.

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

Process directed graphs/edges? #65

Open
pbias opened this issue Jun 9, 2020 · 3 comments
Open

Process directed graphs/edges? #65

pbias opened this issue Jun 9, 2020 · 3 comments

Comments

@pbias
Copy link

pbias commented Jun 9, 2020

Hi,

Thanks for providing such useful tool ! I was reading the doc of the project, as well as the issues on github, and I couldn't find any information on working on directed graphs/edges.

Is there a way to use directed edges?

Thanks in advance :)

@brooksandrew
Copy link
Owner

@pbias - good question. It's currently built for undirected graphs. I can't remember if there was a good reason for this constraint when I first started this project. I think this could be done by swapping NetworkX MultiDiGraph instead MultiGraph (example here). Not sure of all the implications, but I'd be happy to review a PR for this that maintains backwards compatibility to undirected problems, if you're interested.

@pbias
Copy link
Author

pbias commented Jun 18, 2020

Thanks for the answer, it is pretty clear ! I think I'll give it a try, if I found anything interesting and not too complicated, I'll submit a pull request with it :) Thanks again !

@chris
Copy link

chris commented Jul 17, 2021

I too am interested in this. I came across this to solve a very similar purpose (trying to cover all trails in a trail network), but in my case, some of the trails are one-way only. @pbias did you take a stab at it? I may take a look if I can, but don't want to repeat the work if someone has already solved it :)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants