Leetcode 2050. Parallel Courses III

Given a DAG of course prerequisites where each course has a duration and any number of courses can run in parallel once prerequisites are satisfied, compute the minimum time to finish all courses. This is the classic longest-path/critical-path problem on a node-weighted DAG — compute each course's earliest completion time as max(completion times of prerequisites) + its duration.