...
As a first example, an indication of the number of versions to consider is given for this
simple graph;
| No Format |
|---|
P ^ A -> B |
The information for the dependency B can come from several places:
...
Here's a graph that illustrates te first 4 aspects:
The following
| No Format |
|---|
P1 P2 ^ ^ A -> B -> C |
where all of P1, A, P2, B have:
...
winner | P depMgt | P dep | A depMgt | A dep | |
|---|---|---|---|---|---|
|
|
|
|
| 0 x |
Ad |
|
|
| X | 1 (c) |
|
|
| X |
| 2 x |
Am,Ad |
|
| X | X | 3 (b) |
etc etc |
| X |
|
| 4 (c) |
|
| X |
| X | 5 (b) |
|
| X | X |
| 6 (b) |
|
| X | X | X | 7 (a) |
| X |
|
|
| 8 x |
| X |
|
| X | 9 (b) |
| X |
| X |
| a x |
| X |
| X | X | b (a) |
| X | X |
|
| c (b) |
| X | X |
| X | d (a) |
| X | X | X |
| e (a) |
| X | X | X | X | f (d) |
The algorithm would have effect on several dimensions/axes/aspects of the problem, that's why there
are so many possible implementations.
...