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.