1 # Check the decomposition of the topological sort.
2 # This decomposition is only performed by the incremental scheduler.
3 # OPTIONS: --no-schedule-whole-component
4 domain: { A[]; B[]; C[]; D[]; E[]; F[]; G[] }
6 { A[] -> C[]; B[] -> C[]; C[] -> E[]; D[] -> E[]; E[] -> F[]; E[] -> G[];
7 A[] -> G[]; B[] -> E[] }