You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently the workflow processor runs branches trying to infere the DAG automatically or using order. The behavior of order prioritizes parallelism over sequential so in [ [ A, B], [C] ], A and B are processed simultaneously and then C is executed. When the graph becomes complex, it's hard to keep track of every parallel processing and it would be easier to describe the order as a graph with nodes and edges.
Considering the example in the documentation:
/--> B -------------|--> D
/ /
A --| /--> E --|
\--> C --| \
\----------|--> F
described as:
[ [ A ], [ B, C ], [ E ], [ D, F ] ]
could become a list of edges:
[ [ A, B], [A, C], [B, D], [C, E ], [ C, F ], [ E, F ] ]
The text was updated successfully, but these errors were encountered:
Currently the workflow processor runs branches trying to infere the DAG automatically or using order. The behavior of order prioritizes parallelism over sequential so in [ [ A, B], [C] ], A and B are processed simultaneously and then C is executed. When the graph becomes complex, it's hard to keep track of every parallel processing and it would be easier to describe the order as a graph with nodes and edges.
Considering the example in the documentation:
described as:
[ [ A ], [ B, C ], [ E ], [ D, F ] ]
could become a list of edges:
[ [ A, B], [A, C], [B, D], [C, E ], [ C, F ], [ E, F ] ]
The text was updated successfully, but these errors were encountered: