Topological Sort - Largest Color Value in a Directed Graph
What is the time complexity of the optimal algorithm that uses topological sort combined with iterative DP to find the largest color value in a directed graph with
n nodes and e edges?