Topological Sort - Largest Color Value in a Directed Graph
Given the following dp table row for node 3: [2, 0, 1, 0, ..., 0] representing counts for colors 'a', 'b', 'c', 'd', ..., and knowing the graph has edges [[0,1],[1,3],[2,3]], which of the following could be the colors string for nodes 0,1,2,3?
