1.

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

A. The graph does not have a strongly connected component.
B. For each pair of vertices u and v, there is a directed path from u to v.
C. ​The graph does not have a topological order.
D. A depth-first traversal starting at vertex S classifies three directed edges as back edges.
Answer» D. A depth-first traversal starting at vertex S classifies three directed edges as back edges.


Discussion

No Comment Found