Details
-
Task
-
Resolution: Unresolved
-
L3 - Default
-
None
-
None
-
Not defined
Description
In the EventProcessInstanceImportService, we traverse the BPMN to find the previous and next mappable flow nodes for a given flow node. This is used for creating updates to the events recorded on a given process instance. This traversal depth is set to a maximum of 10, so in most cases should find the neighbouring nodes to make these updates. However, there is an edge case where in extremely complicated diagrams with many consecutive gateways, that it doesn't find all neighbours using the maximum depth. There is also nothing to stop the recursion other than finding a mappable node, meaning that there is a potential for efficiency gains in diagrams that have loops that don't contain mappable nodes themselves. We can solve both of these problems by detecting loops in the traversal and using this as the breaking condition, meaning it could traverse only as far as it needed and reach all neighbours.