Most Efficient Time Complexity of Topological Sorting is? (V – numb – McqOptions

MCQOPTIONS

1.	Most Efficient Time Complexity of Topological Sorting is? (V – number of vertices, E – number of edges)
A.	O(V + E)
B.	O(V)
C.	O(E)
D.	O(V*E)
Answer» B. O(V)

Discussion

No Comment Found

Related MCQs

Most Efficient Time Complexity of Topological Sorting is? (V – number of vertices, E – number of edges)
When the topological sort of a graph is unique?
A man wants to go different places in the world. He has listed them down all. But there are some places where he wants to visit before some other places. What application of graph can he use to determine that?
Topological sort is equivalent to which of the traversals in trees?
Topological sort can be implemented by?
Topological sort of a Directed Acyclic graph is?
What can be the applications of topological sorting?
Topological sort starts from a node which has?
Most Efficient Time Complexity of Topological Sorting is? (V ‚Äö√Ñ√∂‚àö√ë‚àö¬® number of vertices, E ‚Äö√Ñ√∂‚àö√ë‚àö¬® number of edges)$
Topological sort can be applied to which of the following graphs?