I have a (long) list of child/ parent relationships (like an organigram), basically, it looks like this:
A and B have no parents, i. e. they are root nodes. Then C is child of A, and D is child of C, i. .e A -> C -> D.
E is child of B, i. e. E -> B. Although it's not explicitly listed, E too is a root node because it's nobody's child.
Is there a way so PDI could explore all paths in this table, and return a "flat list" (as shown above, A -> C -> D).
Thanks so much for any help!