Topological Sort - Largest Color Value in a Directed Graph
Consider the following code snippet implementing the optimal solution for the largest color value in a directed graph. Given
colors = "abaca" and edges = [[0,1],[0,2],[2,3],[3,4]], what is the value of max_color_value after processing all nodes?