alcinnzHoppcraft's Algorithm starts by assuming all nodes are equivalent. It operates by preceding to seek out counter-examples. Upon finding one, gathering all nodes which share the same counter-example, & thus splits the possibly-duplicate set.
A separate set is tracked of the possibly-equivalent subsets left to be considered. Once it found all counter-examples in all the possibly-equivalent subsets... We're done!
Takes O(n*log log n), very performant for the job!
3/5?
All GNU social JP content and data are available under the