[Solved] When the topological sort of a graph is unique?

McqMate

Q.	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» A. when there exists a hamiltonian path in the graph

3.6k

0

Do you find this helpful?

27

View all MCQs in

High Performance Computing (HPC)

Discussion

No comments yet

Related MCQs

Topological sort of a Directed Acyclic graph is?
Topological sort can be applied to which of the following graphs?
In most of the cases, topological sort starts from a node which has __________
Suppose there are 16 elements in a series then how many phases will be required to sort the series using parallel odd-even bubble sort?
Which of the following is not an application of topological sorting?
A complete graph is a graph in which each pair of vertices is adjacent
A decomposition can be illustrated in the form of a directed graph with nodes corresponding to tasks and edges indicating that the result of one task is required for processing the next. Such graph is called as
The complexity of bubble sort is Θ(n2).
Bubble sort is difficult to parallelize since the algorithm has no concurrency.
While mapping Bitonic sort on Hypercube, Compare-exchange operations take place between wires whose labels differ in