- Graph is a decision tree/DAG (we block cycles). Nodes carry: weeks, cost, hours/week, utility.
- Edge probability is optional (defaults 1). Path probability is the product of edge probs.
- Scenario totals (root→leaf): Weeks=sum(weeks), Cost=sum(cost), Person-hours=sum(weeks*hours/week), Utility=sum(utility).
- Expected Utility (EU) = Utility * Path Probability. We also show raw totals.
- Filters (top) hide scenarios exceeding Max Weeks/Cost or below Min Utility.