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

Non weighted graph algorithms on weighted graphs #28

Closed
JanPalasek opened this issue Apr 16, 2019 · 2 comments
Closed

Non weighted graph algorithms on weighted graphs #28

JanPalasek opened this issue Apr 16, 2019 · 2 comments

Comments

@JanPalasek
Copy link

Hi, I need to perform Tarjan strongly components finding algorithm on a weighted directed graph. Is there any way to do that, except for manually trying to convert one graph to another? Thanks.

@justcoding121
Copy link
Owner

justcoding121 commented Apr 16, 2019

I don't think there is a way to do this without converting. I will try to update the graph algorithms to be generic enough to accept all types of graphs.

@justcoding121
Copy link
Owner

Updated beta to accept generic a graph interface. If you pass a Weighted DiGraph, it will use OutEdges to run the algorithm.

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

2 participants