A recursive-iterative algorithm to solve the equation for one-dimensio
nal gradually varied steady flow in a canal network is developed. The
recursion is used to sweep up and down the network, whereas iterations
are used to obtain convergence for the discharge distribution at cana
l junctions. The convergence characteristics of different discharge up
dating techniques are discussed. The application of the algorithm is d
emonstrated through eight test problems on two networks, by starting t
he computations from different initial guesses of discharge distributi
on in the network. (C) 1998 Elsevier Science Ltd.