| 23 | | This is because the usual algorithms search for the vertices reachable by s in the residual graph. However, the original graph is not a residual graph, and thus the constructed graph "g" not as well, as it has no back-edges. Therefore, the partition of vertices is calculated incorrectly, and therefor the edges exhibiting the cut as well. |
| | 23 | This is because the usual algorithms search for the vertices reachable by s in the residual graph. However, the original graph is not a residual graph, and thus the constructed graph "g" not as well, as it does not have to have all back-edges. Therefore, the partition of vertices is calculated incorrectly, and therefor the edges exhibiting the cut as well. |
