In this paper, we use the technique in dealing with the large sparse matrix to condense the memory of the Jacobi matrix J(H) of pipe network equtions F(H)=0 with one dimensional vectors. By applying the graphthe oretic method, we present the optimization