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)

2026-344

In a Barabási-Albert model with   m   = 2, node A is added at time tA= 1 and node B at time tB = 4, as illustrated in the Figure. Here tA an...

  • 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 ...
  • 2021-009
    Find the derivative of $$ f(t) = \frac{1}{t} − \frac{1}{2t^3} + \frac{1}{2t^5} $$. \( f'(t) = \dfrac{1}{t} − \dfrac{1}{2t^3} + \dfra...