The paper presents in a generalized form the problem of the geodetic network adjustment by the Helmert-Pranis Pranievich groups method (groups with junction points included or not).

The adjustment problem, as well as the cofactor matrix derivation for the partial-independent and linkage unknowns, was completely formulated by transformed weight matrix definition and usage.

A complete sequence of the computing stages for the geodetic networks divided into groups without junction points was given for efficient programming of adjustment processing on computer.

A practical example illustrates the identity of the solutions and the cofactors obtained by the group adjustment proposed to those obtained by the block adjustment.

1980 Mathematics Subject Classification (1985 revision): 35F05, 35F20.