Skip to content
Related Articles

Related Articles

GATE | GATE CS 2021 | Set 2 | Question 56

Improve Article
Save Article
Like Article
  • Last Updated : 23 May, 2021

Consider the following directed graph:

Which of the following is/are correct about the graph?
(A) The graph does not have a topological order
(B) A depth-first traversal starting at vertex S classifies three directed edges as back edges
(C) The graph does not have a strongly connected component
(D) For each pair of vertices u and v, there is a directed path from u to v

Answer: (A) (B)

Explanation: (A) True, because of cycle in the bottom left corner of the graph.

(B) True, we can come back length of 3 edges.

(C) The graph does have a strongly connected component, it has cycle.

(D) False, not a strongly connected graph.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!