[FEAT] CasePathResolver: infer "holes" in the path

[tbouffard]

DISCLAIMER: this issue describes path computation for a single instance/case only. So the implementation will go to the CasePathResolver class as it differs from PathResolver which is a generic implementation that both deals with single instance or all instances of a process.

Description

Experiment ways to detect completed elements in the paths that we know for sure.

For example, the following can be inferred

• "task unknown": its predecessor is a parallel gateway
• "another unkown": its successor "task" is completed

flowchart LR
    A((start 1))--> gateway{+}
    %% X((start 2))  --> gateway
    gateway --> task1(task1) & taskUnkown(task unknown) --> gatewaySplit
    gatewaySplit{+} --> task(another unkown)
    --> a(task) --> end1((end))

Loading

Notes

This functionality can be resource-intensive, so we should describe precisely the use cases to be covered.
In particular, the search depth could be configurable, i.e. the number of elements the algorithm attempts to deduce. Think about loops for example.

Notice that it is a topic that is covered in the graph theory, so a lot of algorithms already exist to deal with this topic.
We may use existing library to handle it and if so, we would probably need to create a dedicated npm package to not force user of bv-experimental-add-ons that don't need it to have these libs in their dependencies list.
Otherwise, we may enable this feature by setting an option, see #23

We may decide to reduce the scope of this feature as a first implementation: only deals with BPMN specifics (parallel gateways for instance) and deals with the rest of the "holes" (to be precised)