Does MPSNodeComparator struggle with cyclic structures?

[rwalt...@gmail.com]

Hi all,

comparing the following trees with MPSNodeComparator.compare(left, right, null, true, true) yields no differences and considers the trees equal, given that the following is true:

A == A' == A'' == A'''

B == B' == B'' == B'''

C == C'

Where  == means that the nodes are semantically equal (different identity, same property values).

Structurally, these trees are different. My question: is this intentional or a bug?

Also, I kinda struggle to understand how the comparison algorithm manages to break cyclic dependencies, so if anyone cares to explain that to me, I'm most curious.

Thanks!