Hi community,
I’m working on a node edge component that illustrates the connections between elements. These is working fine with the usage of DCF, but I’m wondering if it is possible to show certain flows based on a root node.
For example, I have a flow like: E1 -> E2 -> E3 -> E4 -> E5, where “E” stands for element. If I were to filter the node edge component by E3, it will show me connections to E2 and E4, but then I will be missing E1 and E5.
Is there a way to make a filter that shows me the complete flow (upstream and downstream), or will I have to create an adhoc data source that performs this filtering within DCF tables?
Thank you!
Hi Sebastian,
What you are trying to do is already a bit more advanced (recursive function) and is probably not possible without an ad-hoc data source. Some additional logic might also be needed to select the correct nodes of the path, because otherwise you would still return everything that is connected to each other. Actually two data sources are needed, one for the nodes and one for the edges of the graph, but that can also be solved by adding a nodes/edges parameter.