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
Article Tags :
Recommended Articles