Changes between Initial Version and Version 1 of Ticket #12797, comment 4


Ignore:
Timestamp:
05/27/14 10:42:58 (7 years ago)
Author:
foosterhof
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #12797, comment 4

    initial v1  
    2121}}}
    2222
    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.
     23This 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.