How can i traverse and find the number of paths in a diagram containing the PARALLEL gateways using any of the Path traversal Algorithm .
For Example : Consider the Diagram below :
As per the regular algorithms , there are 3 path generated
- s0->t0->go->t1->g1->t3-> f0
But as per the BPMN rules , there can only be two paths ie:
How can i achieve this ?
What algorithms are you talking about?
Breadth First Search Algorithm , Depth First Search or Dijkstra’s. Any graph traversal algorithm .
I guess you’d have to change the algorithm. I’m afraid I can’t help you with this as I’m not an expert.
How do we traverse a BPMN Diagram ???
You can do
const definitions = modeler.getDefinitions():
You need know how to jump from a to b? or from a => b => c => end?
I’m working on a similar issue. Did you ever find a solution to this?