A Fortran program is given which performs the hierarchical ascending classification according to the principle of chain searching of reciprocal neighbours. This program operates either on a coordinate table or on a correspondence table.
The reciprocal neighbours algorithm yields total and exact hierarchies for certain agglomeration criteria (e. g. single, or complete or average linkage). It is a cheap method in time and in storage space. Performance of HIVOR has shown itself very