+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which of the following is not a topological sorting of the given graph?

(a) A B C D E F

(b) A B F E D C

(c) A B E C F D

(d) A B C D F E

Query is from Directed Acyclic Graph topic in division Graph of Data Structures & Algorithms I

The question was asked in a national level competition.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Right choice is (d) A B C D F E

Explanation: Topological sorting is a linear arrangement of vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering. In A B C D F E, F comes before E in ordering.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.