INTRODUCTION TO COMPILER DESIGN
OVERVIEW OF COMPILERS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which of the given statement is true?
|
|
All the Cyclic Directed Graphs have topological sorting
|
|
|
All the Acyclic Directed Graphs have topological sorting
|
|
|
All Directed Graphs have topological sorting
|
|
|
All the cyclic directed graphs have non topological sorting
|
Explanation:
Detailed explanation-1: -Which of the given statement is true? Explanation: Cyclic Directed Graphs cannot be sorted topologically.
Detailed explanation-2: -Topological sorting is not possible for a graph if it is not a DAG.
Detailed explanation-3: -A topological sort is a graph traversal in which each node v is only visited after all of its dependencies have been visited. If the graph contains no directed cycles, then it is a directed acyclic graph.
There is 1 question to complete.