Top parent hierarchy search

[aworker]

Hi @bruno29a

I understand now. Certainly a possible alternative. Thanks for the explanation !

Best

Ael

[aworker]

Hi @ipazin

I had never used the -Cell Replacer- node so didn’t know about it. Very useful to know and certainly the best solution. Thanks @ipazin !

Best

Ael

[ipazin]

Tnx @aworker and @bruno29a!
Cell Replacer is really useful and one of my favorite nodes. And if once gets improvements like wildcards and regex it will supernode
Ivan

[bruno29a]

Hi @ipazin , indeed, I can see that. Like @aworker , I’ve never used it before. It’s a very useful node.

[aworker]

@ipazin

Also stop criteria is probably a good idea so you don’t have to run large number of iterations to be sure you’ll find parent.

@ipazin Just a comment about the loop stop criteria. Your recursive loop stops at a fix arbitrary number of iterations which is larger than the number of rows. The number of rows is a better upper bound since the loop should not iterate more than the number of rows (i.e. the number of nodes in the graph). This is still an upper bound which could be lowered to the minimum number of iterations. This can be done using as condition that the LevelUp column had not changed compared to its previous values, as follows:

Could the condition checking be implemented with less nodes ? Please suggest. I’m curious

Best

Ael

[ipazin]

Hello @aworker,

the number of rows is indeed better upper bound if not building stop criteria. For a stop criteria I was using similar approach and needed 4 nodes but had different workflow design (no Rule Engines outside loop and one Rule Engine was inside loop to give entire path which led to parent) which allowed me to aggregate on last column to count missing values and stop based on it. Your approach seems better. Alternative that comes to my mind is as always scripting…

Br,
Ivan

[aworker]

Hi @ipazin

Thanks for the explanation. I appreciate it.

Best

Ael