24.1.4. Pseudo Code for Algorithm

Try these first

1. 1.

   What does the in-degree of a vertex represent?

   Hint

   Think of how many connections come into a node.

2. 2.

   Give an example of a vertex with an in-degree of 0.

   Hint

   Look for vertices without any arrows leading in.

3. 3.

   What is the in-degree of a vertex?

   • The number of outgoing edges
   • The number of incoming edges
   • The total number of edges

   Hint

   Think about how many connections come to a specific point.

4. 4.

   Can a topological sort be performed on a graph with cycles?

   • True
   • False

   Hint

   Consider the dependencies and if they loop back on themselves.

5. 5.

   Create a DAG with at least 5 vertices and 7 edges, and demonstrate how to perform topological sorting on it.

   Hint

   Start with any vertex that has no incoming connections.

6. 6.

   Explain how you would modify the algorithm to handle cases where edges might be added dynamically.

   Hint

   Consider how to integrate new tasks efficiently.