# Complexity of set partition generation while equivalence relation is given

Given a binary equivalence relation, R on a set A, Let P be the resulting partition. I want to generate the partition means each subset in the partition. What would be the fastest algorithm for this purpose? please help.

• @ShuvraChakraborty, the running time would be $O(|A| + |R|)$. – D.W. Apr 19 at 15:37