The TreeSynthesizer does not resolve cycles in tree
spanning relations. Therefore, if there is a cycle in the
tree spanning relations, the system crashes with a stack
overflow.
That's not a bug. This restriction that the graph mustn't
contain cycles regarding tree spanning relations is known
and must be treated by the sorrounded system. It has not
been implemented regarding to performance issues.
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Logged In: YES
user_id=956699
In fact, the problem is that reflexive relations are not tested
when building the tree.
Logged In: YES
user_id=77680
That's not a bug. This restriction that the graph mustn't
contain cycles regarding tree spanning relations is known
and must be treated by the sorrounded system. It has not
been implemented regarding to performance issues.