Time Complexity of DFS is? (V – number of vertices, E – number of – McqOptions

MCQOPTIONS

1.	Time Complexity of DFS 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

In Depth First Search, how many times a node is visited?
Regarding implementation of Depth First Search using stacks, what is the maximum distance between two nodes present in the stack? (considering each edge length 1)
Which of the following is not an application of Depth First Search?
Time Complexity of DFS is? (V – number of vertices, E – number of edges)
IN_DEPTH_FIRST_SEARCH,_HOW_MANY_TIMES_A_NODE_IS_VISITED??$
Regarding implementation of Depth First Search using stacks, what is the maximum distance between two nodes present in the stack? (considering each edge length 1?
When the Depth First Search of a graph is unique?
What can be the applications of Depth First Search?
A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?
The Depth First Search traversal of a graph will result into?