MathJax


Tuesday, November 15, 2022

2022-180

Consider the directed graph given below and select the correct alternative that best decompose the graph into strongly connected components.

A.{P, Q, R, S}, {T}, {U}, {V}

B.{P, Q, S, T, V}, {R}, {U}

C.{P, Q, R, S, T, U, V}

D.{P, Q, R, S, T, V}, {U}

E. None of the above

Original idea by: Muhammad Idrees

No comments:

Post a Comment

2025-261

Consider a directed graph \(G\)   and the Kosaraju-Sharir's algorithm for finding strongly connected components (SCCs). Analyze the foll...