Computation of maximal flows in networks

A simple computational method, based on the simplex algorithm of linear programming, is proposed for the following problem: “Consider a network (e.g., rail, road, communication network) connecting two given points by way of a number of intermediate points, where each link of the network has a number assigned to it representing its capacity. Assuming a steady state condition, find a maximal flow from one given point to the other.”