When the topological sort of a graph is unique

Home / Data Structure / Miscellaneous On Data Structures / Question

Examveda

When the topological sort of a graph is unique?

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

Answer: Option A

Related Questions on Miscellaneous on Data Structures

A. Array

B. Linked List

C. Stack

D. Queue

View Answer

A. For implementing a stack-based algorithm

B. To maintain a balanced binary tree

C. For efficient sorting of elements

D. To test membership in a large dataset

View Answer

A. Queue

B. Stack

C. Heap

D. Array

View Answer

A. Array

B. Hash Map

C. Trie

D. Array

View Answer