Network Flows, Algorithms, Modeling, Data Science, Artificial Intelligence.
except i and j; let's call them k and k`. We add edges (k, k`) with capacity one and every other edge we set it to infinite capacity. node-disjoint paths (red) from start to end in a given directed graph G=(V, E). Note that the graph is the same as before, with the addition of the duplicate nodes.