4 docs tagged with "Topological Sort"

For example, the pair [0, 1], indicates that to take course 0 you have to first take course 1. Return true if you can finish all courses. Otherwise, return false.

Return the ordering of courses you should take to finish all courses. If there are many valid answers, return any of them. If it is impossible to finish all courses, return an empty array.

Among all possible rooted trees, those with minimum height (i.e. min(h)) are called minimum height trees (MHTs).

Sort Items by Groups Respecting Dependencies...