#๐ Minimum cut/Maximum flow
7 messages ยท Page 1 of 1 (latest)
@coral island
Remember to:
- Ask your Python question, not if you can ask or if there's an expert who can help.
- Show a code sample as text (rather than a screenshot) and the error message, if you've got one.
- Explain what you expect to happen and what actually happens.
:warning: Do not pip install anything that isn't related to your question, especially if asked to over DMs.
Closes after a period of inactivity, or when you send !close.
Enter the number of vertices: 5
Enter name for vertex 1: S
Enter name for vertex 2: A
Enter name for vertex 3: B
Enter name for vertex 4: C
Enter name for vertex 5: T
Enter the number of edges: 7
Enter edge (start_vertex end_vertex capacity): S A 8
Enter edge (start_vertex end_vertex capacity): S C 11
Enter edge (start_vertex end_vertex capacity): A T 3
Enter edge (start_vertex end_vertex capacity): B A 5
Enter edge (start_vertex end_vertex capacity): B T 5
Enter edge (start_vertex end_vertex capacity): C B 3
Enter edge (start_vertex end_vertex capacity): C T 1
Available vertices: C, B, T, A, S
Enter the source vertex: S
Enter the sink vertex: T
The maximum possible flow is 7
Edges in the minimum cut:
B -> S
A -> T
A -> S```
like the max flow is correct but the edges the minimum cut actually cuts should be
A -> T
C -> B
C -> T
pls help
@coral island
This help channel has been closed and it's no longer possible to send messages here. If your question wasn't answered, feel free to create a new post in #1035199133436354600. To maximize your chances of getting a response, check out this guide on asking good questions.