Plan from the supplied facts
All arrows in this fictional acyclic graph mean precedence only: A→B, B→C, A→C. A→C adds no new ordering because A must already precede B, which precedes C. This simplification is valid only for the stated precedence meaning, not for separate file or interface deliveries.
| Edge | Alternative path | Keep in simplified graph |
|---|---|---|
| A→B | None | Yes |
| B→C | None | Yes |
| A→C | A→B→C | No |
Work through the choice
The permitted build orders stay the same after removing A→C. If it actually carries a unique required artefact, that is another edge meaning and cannot be removed by this argument.
Could B→C be removed too while preserving this ordering?
Show the worked answer
No. After removal there is no path requiring B before C. The order A,C,B would become permitted, changing the model.
Material to use in your plan
Label edge meaning before simplification. For each candidate edge, remove it temporarily and check whether another path still connects source to destination. Restore edges that supply distinct required artefacts.