Consider the directed acyclic graph (DAG) below:
Which of the following is/are valid vertex orderings that can be obtained from a topological sort of the DAG?

- AP Q R S T U V
- BP R Q V S U T
- CP Q R S V U T
- DP R Q S V T U
Programming, Data Structures and Algorithmsbasic graph algorithms: traversals and shortest pathMSQ2 marksEasy

A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.