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)

2025-310

Which of the following alternatives contains a graph with only one Strongly Connected Component (SCC)?  a) b) c)  d)   e) None of the above ...

  • 2021-028
     When a Bianconi-Barabási model reduces to a Barabási-Albert model? When the degree distribution is a normal distribution When the fitnes...
  • 2022-092
    Read the statements about clustering coefficient below: Local clustering coefficient measures the connectivity of a node to the rest of ...
  • 2022-181
    The Kosaraju-Sharir algorithm is an algorithm used to find strongly connected components in a graph. Applying the algorithm on the graph...