Consider that the following DAG (Directed Acyclic Graph) represents tasks and requirements between tasks.
Evaluate the following statements:
- There are a total of 12 strongly connected components;
- There are a total of 4 valid topological sorting possibilities;
- Starting a DFS on node 2 might result in having two cross edges;
- The DAG indicates that to perform task 10, you must perform task 7 before tasks 8 and 9.
Select the best answer:
- 1 - True, 2 - False, 3 - True, 4 - False
- 1 - False, 2 - True, 3 - True, 4 - False
- 1 - True, 2 - False, 3 - True, 4 - True
- 1 - False, 2 - False, 3 - False, 4 - False
- None of the above
Original idea by André Portela
No comments:
Post a Comment