a. Prove that the topological sorting problem has a solution if and only if it is a dag.
b. For a digraph with n vertices, what is the largest number of distinct solutions the topological sorting problem can have?
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.