This paper discusses algorithmic properties of a class of complementarity programs involving strictly diagonally isotone and off-diagonally isotone functions, i. e., functions whose Jacobian matrices have positive diagonal elements and nonnegative off-diagonal elements, A typical traffic equilibrium under elastic demands is cast into this class. Algorithmic properties of these complementarity problems, when a Jacobi-type iteration is applied, are investigated. It is shown that with a properly chosen starting point the generated sequence are decomposed into two converging monotonic subsequences. This and related will be useful in developing solution procedures for this class of complementarity problems.