Topological sort can be applied to which of the following graphs?

Related MCQs

• In most of the cases, topological sort starts from a node which has __________
• Topological sort of a Directed Acyclic graph is?
• When the topological sort of a graph is unique?
• Which of the following is not an application of topological sorting?
• 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?
• Best-first search (BFS) algorithms can search both graphs and trees.
• Is Best First Search a searching algorithm used in graphs.
• Pivot in Quick sort can be selected as
• In first step of parallelizing quick sort for n elements to get subarrays, which of the following statement is TRUE
• Which Parallel formulation of Quick sort is possible