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

Improve MCMF #126

Open
simonlindholm opened this issue Jul 23, 2019 · 1 comment
Open

Improve MCMF #126

simonlindholm opened this issue Jul 23, 2019 · 1 comment

Comments

@simonlindholm
Copy link
Member

@ecnerwala generously provided the following: https://codeforces.com/contest/1178/submission/57573815

@RealA10N
Copy link

RealA10N commented Oct 1, 2023

The current implementation does not support double edges.
I propuse the following: https://github.com/RealA10N/hactl/blob/main/content/graph/MinCostMaxFlow.h
Which is tested to work with negative edges, and double edges. Performence worst (as expected) but not far behind the current implementation. It also contains the right time complexity (related to #217)

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

No branches or pull requests

2 participants