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

Retrieving residual capacities without networkx #21

Open
paredesroger opened this issue Nov 13, 2015 · 3 comments
Open

Retrieving residual capacities without networkx #21

paredesroger opened this issue Nov 13, 2015 · 3 comments

Comments

@paredesroger
Copy link

Not sure if the issue tracker is the right place to address my question. Basically, I need to run a maximum flow algorithm several times but I am interested not only in the value of the maximum flow (or size of the cut) but also in the flow graph (residual capacities would suffice). PyMaxflow is very fast when it comes to compute the maximum flow but using get_nx_graph(self) to retrieve the residual capacities becomes a bottleneck in my code. Is there anyway I can access to the residual capacities without using get_nx_graph(self)?

Thank you so much!

@pmneila
Copy link
Owner

pmneila commented Nov 13, 2015

Hi,

It's the right place.

Unfortunately, there is no way to get the residual capacities of the graph other than get_nx_graph. I'm going to try to implement a faster access to these capacities at some point in the next few weeks, but you will have to live with get_nx_graph until then, sorry.

@paredesroger
Copy link
Author

For now is ok and actually following this process is still faster than using only networkx so I'm glad that I came across PyMaxflow. However, the implementation to access to the residual capacities would definitely augment the functionality of your library and I bet that I am not the only one that would benefit from it.

Thank you so much for your help!

@davisv7
Copy link

davisv7 commented Feb 7, 2024

Bump.

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