Partitio refinement techniques are used in many algorithm. This tool allows efficient computation ofequivalence relations and is somehow dual to union-find algorithms. The goal of this paper is to propose a single routine to quickly implement all these already known algorithms and to sole a large class of potentially new problems. Our framework yields to a unique scheme for correctness proofs and complexity analysis. Various exampels are presented to show the different ways of using this routine.
展开▼
