A safe order for tasks that depend on one another is known as a topological ordering. Consider the following directed graphs, where edges indicate task dependency.
I)
II)
III)
Please, select the option that shows which graphs admit a topological ordering.
- I and III.
- I, II, and III.
- II.
- I.
- None of the above.
Original idea by: Felipe Crispim da Rocha Salvagnini
No comments:
Post a Comment