Solution: Parallel Courses III

Statement  

You are tasked with determining the minimum time required to complete a set of courses, given their prerequisite relationships and individual durations.

There are n courses labeled from 1 to n. The prerequisite relationships between these courses are provided as a 2D integer array relations, where each entry $\text{relations}[j] = [\text{prevCourse}_j, \text{nextCourse}_j]$ ...