adorable-rocket-59214
12/17/2024, 9:27 AMwf_a(input)
and wf_b(input)
Can create a DAG like
• task_a(ONE)
• task_a(TWO)
• task_b(ONE)
• task_b(TWO)
Where any task_b is dependent on ALL task_a tasks successfully executing.
I was wondering if there was a way where I could keep the dynamic definitions, but end up with a DAG like
• task_a(ONE) >> task_b(ONE)
• task_a(TWO) >> task_b(TWO)
where the tasks are dependent at an input level (i.e. if the inputs are the same, you have a dependency)
I also don't mind moving to another concept like Map tasks, but the main focus is to not have to write the tasks individually to get the dependencies.thankful-minister-83577