Topological sorting results in
a. vertices arranged so the directed edges all go in the same direction.
b. vertices listed in order of increasing number of edges from the beginning vertex.
c. vertices arranged so A precedes B, which precedes C, and so on.
d. vertices listed so the ones later in the list are downstream from the ones earlier.
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.