Revise the topological sorting algorithm topsortl by removing predecessors instead of successors. Trace the new algorithm for each graph in Figure.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.