Use the network simplex algorithm to find a max flow for the network of Fig XXXXXXXXXXThe starting basic solution can have a flow of zero on every arc. Arbitrarily let S contain all the nodes except...

Use the network simplex algorithm to find a max flow for the network

of Fig. 3.10. The starting basic solution can have a flow of zero on every arc.

Arbitrarily let S contain all the nodes except t, and let the starting basis be

an arbitrarily chosen spanning tree that includes arc (t, s). Thus, t is a leaf

node of the basis tree. The solution may not have the same flow pattern as

Fig. 3.11, but it should have the same maximum flow.