This repository has been archived by the owner on Oct 22, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 11
Incorrect MinCut result #27
Comments
I made a PR : #32 |
Merged
@JuliaRegistrator register() |
Error while trying to register: "File (Julia)Project.toml not found" |
@JuliaRegistrator register() |
Error while trying to register: "Tag with name |
@JuliaRegistrator register() |
Error while trying to register: Changing UUIDs is not allowed |
@JuliaRegistrator register() |
Registration pull request created: JuliaRegistries/General/9016 After the above pull request is merged, it is recommended that a tag is created on this repository for the registered package version. This will be done automatically if Julia TagBot is installed, or can be done manually through the github interface, or via:
|
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Hi,
mincut seems to return false result with this graph:
Non-labeled edges have infinite capacity
edges 1-2, 4-7, 5-7 and 6-7 are saturated after the running of the algorithm
Output:
[1, 3, 6, 5] [2, 4, 7] 3.0
Expected Output
[1, 2, 3, 4, 5, 6] [7] 3.0
The algorithm should find every reachable node from the source by a flow, it instead reaches nodes reachable by non saturated direct edges
How to reproduce:
The text was updated successfully, but these errors were encountered: