MathJax


Saturday, May 6, 2023

2023-214

Consider the following directed graph:

In order to apply the Kosaraju-Sharir algorithm, a DFS was performed and the following start and end times were computed:

What will be the first strongly connected component detected in this graph?

  1. {7}.
  2. {4, 5, 6}.
  3. {2, 3, 4}.
  4. {1, 2, 3}.
  5. None of the above

Original idea by: Christian Konishi

at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

2023-228

A company launched a new gadget C to be produced globally for North American and South American markets. The company uses just-in-time as ...

  • 2022-174
    In the Non-linear preferential attachment, the preferential attachment probability becomes \( \Pi(k) \sim k^{\alpha} \). For a starting netw...
  • 2021-041
    Considering the following network and its partition in green and pink nodes: The modularity \( M \) of a partition can be computed using...
  • 2022-102
    Select the correct alternative based on the following statements: A very large network in the scale-free regime should have \( \langle k...