A pseudocode description of recursive DFS is given in Algorithm 13.6. Algorithm DFS(G, v): Input: A graph G and a vertex v in G Output: A labeling of the edges in the connected component of v as discovery edges and back edges, and the vertices in the connected component of v as explored Label v as explored for each edge, e, that is incident to v in G do if e is unexplored then Let w be the end vertex of e opposite from v if w is unexplored then Label e as a discovery edge DFS(G, w) Label e as a back edge Algorithm13.6: A recursive description of the DFS algorithm for searching from a vertex, v. Can we use a queue instead of a stack as an auxiliary data structure in the topological sorting algorithm shown in Algorithm 13.16