Consider a possible implementation of topologicalSort() by using in it the following routine:
minimalVertex(digraph) v = a vertex of digraph; while v has a successor v = successor(v); return v;
What is the disadvantage of using this implementation?
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.