Question 3.3

3. The following digraph cannot be an order-requirement digraph because

  1. no vertex has four edges that enter that particular vertex.
  2. all the tasks require the same time to complete.
  3. it has a directed circuit.
image

3.

c