Past exam of the mathematics course of the University of Cambridge / 2025 / iii / Paper 221 / 3 / a

Table of contents
- Solution a

Solution

A minimal causal directed acyclic graph has edges

A \to Y, q u a d A \to M, q u a d M \to Y, q u a d M \to S, q u a d Z \to A, q u a d D \to A, q u a d D \to C, q u a d C \to M, q u a d G \to A, q u a d G \to Y, q u a d W \to Y .

 Ancestors (10)

 View article source

 Discussion (0)

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version