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