Question 6. (12 points) The topological sorting algorithm, for a directed acyclic graph with vertices
labeled 0 through n1, can be described by the following pseudocode: 1. Calculate the indegree of
each vertex. 2. Scan the vertices (from 0 to n1 ) and enqueue into queue Q any vertex that has
indegree 0. 3. while Q is not empty: a. Dequeue a vertex v from the queue. Make v the next vertex
in the topological ordering (add it to the end of a list L ). b. Traverse v 's adjacency list. For each
vertex adjacent to v in the graph, decrease its indegree. If that vertex adjacent to v now has
indegree 0 , then enqueue it into the queue. 4. Output the list L. The following is an adjacency list
representation of a graph. It happens to be a directed acyclic graph, which means that the
topological sorting algorithm can be applied to it. - (6 points) First, draw the directed graph that the
adjacency list represents. - (6 points) Second, show what topological ordering the algorithm
outputs. As you execute the topological sorting algorithm, be careful to choose correctly which
vertex gets entered into the queue (based on the pseudocode above) and therefore what order the
vertices are put into list L..
Question 6 12 points The topological sorting algorithm f.pdf
1. Question 6. (12 points) The topological sorting algorithm, for a directed acyclic graph with vertices
labeled 0 through n1, can be described by the following pseudocode: 1. Calculate the indegree of
each vertex. 2. Scan the vertices (from 0 to n1 ) and enqueue into queue Q any vertex that has
indegree 0. 3. while Q is not empty: a. Dequeue a vertex v from the queue. Make v the next vertex
in the topological ordering (add it to the end of a list L ). b. Traverse v 's adjacency list. For each
vertex adjacent to v in the graph, decrease its indegree. If that vertex adjacent to v now has
indegree 0 , then enqueue it into the queue. 4. Output the list L. The following is an adjacency list
representation of a graph. It happens to be a directed acyclic graph, which means that the
topological sorting algorithm can be applied to it. - (6 points) First, draw the directed graph that the
adjacency list represents. - (6 points) Second, show what topological ordering the algorithm
outputs. As you execute the topological sorting algorithm, be careful to choose correctly which
vertex gets entered into the queue (based on the pseudocode above) and therefore what order the
vertices are put into list L.
