+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which of the given statement is true?

(a) All the Cyclic Directed Graphs have topological sortings

(b) All the Acyclic Directed Graphs have topological sortings

(c) All Directed Graphs have topological sortings

(d) All the cyclic directed graphs hace non topological sortings

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

I got this question at a job interview.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
Right choice is (d) All the cyclic directed graphs hace non topological sortings

The best explanation: Cyclic Directed Graphs cannot be sorted topologically.

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.

Categories

...