23.2.5. Topological Sorting of DAGs

Try these first

1. 1.

   Define a Directed Acyclic Graph.

   Hint

   Think about the word 'acyclic'. What does it mean?

2. 2.

   What does in-degree mean in the context of a DAG?

   Hint

   Consider how many arrows point towards a task.

3. 3.

   What does a DAG resemble in project management?

   • Cycle
   • Task Dependency
   • Random Tasks

   Hint

   Think about how tasks relate to each other.

4. 4.

   True or False: A cycle in a DAG allows for topological sorting.

   • True
   • False

   Hint

   What happens to dependencies if they loop?

5. 5.

   Create your own DAG with at least five tasks and define the dependencies. Then, perform a topological sort.

   Hint

   Think about a daily routine and what tasks depend on others.

6. 6.

   Given a complex job structure where teams cannot start until the previous team finishes, outline a strategy to organize this structure using a DAG.

   Hint

   What is the final task that can be performed without waiting?