Skip to content
Related Articles

Related Articles

Algorithms | Graph Traversals | Question 12

View Discussion
Improve Article
Save Article
Like Article
  • Last Updated : 28 Jun, 2021

Is following statement true/false?

A DFS of a directed graph always produces the same number of tree edges, i.e., independent of the order in which vertices are considered for DFS.
(A) True
(B) False

Answer: (B)

Explanation: Consider the following graph. If we start from ‘a’, then there is one tree edge. If we start from ‘b’, then there is no tree edge.


Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!