If a network has several sources s 1 , , s k , show that it can be reduced to the case of a single source network by introducing a new vertex s and connecting s to s 1 , , s k , by k edges of capacity Similarly if there are several sinks Illustrate this idea by a network with two sources and two si...

We connect one of the sources to all sinks by a cap ...

If a network has several sources s 1 , , s k , show that

Question:

If a network has several sources s₁, · · ·, s_k, show that it can be reduced to the case of a single-source network by introducing a new vertex s and connecting s to s₁, · · ·, s_k, by k edges of capacity ∞. Similarly if there are several sinks. Illustrate this idea by a network with two sources and two sinks.

Fantastic news! We've Found the answer you've been seeking!