| Table of Contents | ||||
|---|---|---|---|---|
|
...
Color | Line | Description |
|---|---|---|
Black |   | The issue does not contribute to the root issue (there is one outward link at least in the branch connecting the issue with the root which breaks the roll-up progress) |
Red |  | The issue contributes to the root (all the chain of linked issues are inward) and all their contributing children are already loaded in the hierarchy, therefore the total contribution of the branch under the issue is well known |
Orange |  | The issue contributes to the root from more than one way and each way does it partially with the same amount (balanced) |
Light red |  | The issue contributes to the root but not all its children have already be loaded, therefore the real total contribution of the branch is unknown as it might vary when more children are loaded |
Yellow |  | The same that the previous one when the issue contributes from more than one branch |
...
When an issue appears in several places contributing, all your appearances are shown with an orange link to indicate that the issue is contributing in different ways.
...
Cycle detection (SERVER ONLY)
When creating links between issues, it may happen that you create cycles between the issues. In some cases, these cycles do not have functional logic and cause their analysis of progress is not correct.
Now, "Links Hierarchy" helps you detect those cycles.
For example, suppose we have 4 issues (A, B, C, and D)
A is blocked by B.
B is blocked by C.
C is blocked by D.
D is blocked by B.
Which issue should be resolved first? How long would it take to resolve issues B, C and D?
A cycle appears that does not have functional logic, so these questions do not have an easy answer.
These cases are detected by "Links Hierarchy", and will mark the issues where it occurs with an orange border. You can review each case and decide if it is correct or not.
...
Progress roll up on cycles
When "Links Hierarchy" detects a cycle, it does not load the descendants indefinitely because it would be an infinite loop. Instead, "Links Hierarchy" warns that the issue was previously shown, and that issue would no longer contribute to the sum.
In these cases, you must take into account that being a hierarchical sum, the intermediate issues from the root issue to the issue detected as a cycle, do not contain the total sum of the cycle. The sum in the cycle issues should be:
Sum up TALH-12 (B) → (TALH-12 + TALH-13 + TALH-14)
Sum up TALH-13 (C)→ (TALH-12 + TALH-13 + TALH-14)
Sum up TALH-14 (D) → (TALH-12 + TALH-13 + TALH-14)
Being a hierarchical sum, "Links Hierarchy" calculates:
Sum up TALH-14 → (TALH-14 + TALH-13 + TALH-12)
| Status | ||||
|---|---|---|---|---|
|
Sum up TALH-12 → (TALH-12 + TALH-13)
| Status | ||||
|---|---|---|---|---|
|
Sum up TALH-13 → (TALH-13)
| Status | ||||
|---|---|---|---|---|
|
In the cycle issues, the total sums will appear in the root issues:
...