Consider the following directed graph: Which of the following is/are correct…

GATE · 2021 · CS · Set 2 · Computer Science & IT

1. A.

   The graph does not have a topological order.

2. B.

   A depth-first traversal starting at vertex S classifies three directed edges as back edges.

3. C.

   The graph does not have a strongly connected component.

4. D.

   For each pair of vertices u and v, there is a directed path from u to v

Attempted by 150 students.