CompositeNDP
│ provides demand Fin {*} │ requires number_of_cars {0}
│ provides network Fin {*} │ requires travel_time {0 minutes}
│ │ requires velocity {0 km/h}
│ │ requires distance {0 km}
│ 12 nodes, 6 edges
│ connected rec: ✓
│ travel_time required by _constant ≤ required travel_time equiv (always satisfied)
│ number_of_cars required by _constant1 ≤ required number_of_cars equiv (always satisfied)
│ distance required by _constant2 ≤ required distance equiv (always satisfied)
│ velocity required by _constant3 ≤ required velocity equiv (always satisfied)
│ provided demand ≤ demand provided by _limit equiv (always satisfied)
│ provided network ≤ network provided by _limit1 equiv (always satisfied)
├ _constant: SimpleWrap
│ │ - │ requires travel_time {0 minutes}
│ └ DP_Constant 𝟙 ⇸ {0 minutes}
│ 0 minutes ≤ 𝒓
├ _constant1: SimpleWrap
│ │ - │ requires number_of_cars {0}
│ └ DP_Constant 𝟙 ⇸ {0}
│ 0 ≤ 𝒓
├ _constant2: SimpleWrap
│ │ - │ requires distance {0 km}
│ └ DP_Constant 𝟙 ⇸ {0 km}
│ 0 km ≤ 𝒓
├ _constant3: SimpleWrap
│ │ - │ requires velocity {0 km/h}
│ └ DP_Constant 𝟙 ⇸ {0 km/h}
│ 0 km/h ≤ 𝒓
├ _limit: SimpleWrap
│ │ provides demand Fin {*} │ -
│ └ DP_Limit Fin {*} ⇸ 𝟙 > VU:*
│ 𝒇 ≤ *
└ _limit1: SimpleWrap
│ provides network Fin {*} │ -
└ DP_Limit Fin {*} ⇸ 𝟙 > VU:*
𝒇 ≤ *