Abstract
We discuss some of the concepts related to the flow problems in a discrete-continuous compound system, and propose an approximation method as well as a numerical algorithm for the maximum-flow problem in a network which is assumed to be locally uniform and sufficiently dense, The algorithm is derived by means of the finite-element technique, and is tested by taking up as an example the maximum-flow problems on the road network of Tokyo Metropolitan Area.
