The generating algorithm of the greatest compatible classes in a compatible relation
Yin Jian-hong · Journal of Hefei University of Technology · 2004
A relation R on a set A is called a compatible relation if it is reflexive and symmetric. Let (B≠), and BA, if xRy where x∈B and y∈B, then B is called the compatible class of R. It is called a greatest compatible class when it is not a proper subset of any other compatible calss.In this paper,the theory of generating the greatest compatible classes of a compatible relation is studied. The breadth first search(BFS),which is an algorithm for generating the greatest compatible classes in a compatible relation,is given.