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->t2->f2
s0->t0->go->t1->g1->t4->f1
s0->t0->go->t1->g1->t3-> f0
But as per the BPMN rules , there can only be two paths ie: