等价标号数组的快速处理算法

Fast Processing Algorithm for Equivalent Label Array

提出了直接和间接等价关系等概念,指出处理等价标号数组的目的就是为了找到足够多的间接等价关系,直至可以为每个标号找出其最小的等价标号。详细论述了有用和无用间接等价关系的区别,最后给出的快速处理算法较传统方法极大地减少了扫描次数和处理时间。

The concepts of direct and indirect equivalence relation are presented. It is pointed that the processing of the equivalent label array is just to pass on enough equivalence relations between labels to find out the minimum equivalent labels for them. The differences between useful and useless indirect equivalence relations are discussed. A fast processing algo-rithm is presented. Compared with those traditional methods, this algorithm can save a lot of scanning and processing time.