Topological sort requires only a tiny addition to the DFS algorithms. Exactly one of the following data structures is required to make it work (although the code in the textbook uses two---only one is essential.)

Question 4 options:

	Queue
	Deque
	Stack
	Hash Table

Save