I\'m struggling to find a solution to this problem with time complexity o(m log n) + O(n).
Assume you have directed acyclic graph with n nodes and m requ
