Skip to content
Astera Technology

Group mutually dependent components into one planning unit

Collapse a dependency cycle instead of pretending it has a linear internal order.

Plan from the supplied facts

Original planning graph is A→B, B→A and B→C. Arrows mean the components need joint integration readiness, not that a person must complete one before starting the other. A and B are mutually reachable, so plan them as group G; the grouped graph is G→C. Internal coordination remains to be designed.

Editable original planning example
NodeMutually reachable withPlanning group
ABG={A,B}
BAG={A,B}
CNo other nodeC
Download editable CSV ↓

Work through the choice

The group exposes external dependencies while acknowledging the internal cycle. Its internal integration work still needs a plan.

Can A,B,C be claimed as an internal precedence order for the original arrows?

Show the worked answer

No. A→B and B→A cannot both be satisfied by a strict linear order. The usable external order is group G before C.

Material to use in your plan

Mark mutually reachable nodes, give each group a planning identity, and draw edges between groups. Record internal integration work separately rather than hiding the cycle.

Related resources