Forum Discussion
Recursive relationships
The relationship is a conceptual "many to many". A given item could have more than one "parent" - any pair of item1 and item2 could have from 0 to n relationships (of different type), where n is 1 or higher.
Also there could be just 1 level of nesting or 4-6 levels of nesting, depending on specific dataset. Would approach with PATH cover it?
Hi,
I have tested this as follows:
The calculated column uses the PATH function. The error explcitely says that a child with multiple parents is not supported.
With a "clean" tree it works:
The big question is what you explicitely know about your graph in advance. If you only have an adjacency matrix or list you are condemmed to graph exploration algorithms. A lot of patterns cover cases, where you know the depth of the graph and can explicitely model what you want. I asked a similar question to the community some time ago, where I gave my aproach in order to ask if they are easier ways:
Multiparent Graph, Recursiveness - Microsoft Fabric Community
I got no answer as the text was presumably too long to read 🙂
Best regards
Christian