MathJax


Sunday, April 3, 2022

2022-078

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.

  1. I and III.
  2. I, II, and III.
  3. II.
  4. I.
  5. None of the above.

Original idea by: Felipe Crispim da Rocha Salvagnini

No comments:

Post a Comment

2026-344

In a Barabási-Albert model with   m   = 2, node A is added at time tA= 1 and node B at time tB = 4, as illustrated in the Figure. Here tA an...