Question: When the topological sort of a graph is unique?
Options
A : When there exists a hamiltonian path in the graph
B : In the presence of multiple nodes with indegree 0
C : In the presence of single node with indegree 0
D : In the presence of single node with outdegree 0
Previous ||
Data Structure Topological Sorting more questions
When will capacitor fully charged?
When does relay’s 1 and 2 come into operation?
When it would be optimal to prefer Red-black trees over....
When do you use a sparse array?
When can malarial parasite be obtained in RBCs of a....
When do we use a constant pressure boundary condition?
When does automatic control system of combustion come into operation?
When is the cooling tower preferred?
When does master controller comes into action?
Data Structure Adjacency List more Online Exam Quiz
Data Structure Stack Operations
Data Structure Stack Using Queues
Data Structure String Reversal Recursion
Data Structure Threaded Binary Tree
Data Structure Undirected Graph
Data Structure Uniform Binary Search