Timeline for How to find a minimum cut of a network flow?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 26, 2021 at 19:21 | comment | added | JimN | @AK_is_curious you are missing the fact that the statement about "reachable nodes" is with respect to being reachable in the residual graph. See any textbook or website that covers network flows on how to construct a residual graph. | |
| Nov 24, 2021 at 14:41 | comment | added | AK_is_curious | Whats defined as "reachable node" here? In an example graph I have every node is reachable from the starting node. And it makes sense to me, as every node that can not be reached by the starting node, can not contribute to the flow. What am I missing? | |
| Dec 14, 2017 at 20:32 | history | answered | JimN | CC BY-SA 3.0 |