mathJax


Friday, May 5, 2023

5th quiz - 05/05/2023

Given the following directed graph, if we executed Kosaraju-Sharir’s algorithm to detect the strongly connected components (SCCs) starting at node A and using descending DFS ordenation (Z to A), what would the SCCs be and in which order they would be returned?



  1. 2 SCCs: returned first BDCA and last FGH;
  2. 2 SCCs: returned first FGH and last BDCA;
  3. 4 SCCs: returned first H, G, F and last BDCA;
  4. 4 SCCs: returned first BDCA, F, G and last H;
  5. None of the above.
Original idea by: Fillipi Valadares
at

1 comment:

Subscribe to: Post Comments (Atom)

7th Quiz - 02/06/2023

Agglomerative hierarchical clustering can be applied to community detection in graphs. By using dendrograms, one can visualize the order in ...

  • 3rd Quiz - 31/03/23
     Generally Real Networks do not behave according to the Random Networks Model, even so, they can share some properties. Analyse the followin...
  • 2nd Quiz - 17/03/23
    Given the image bellow of a small part of the Campinas' streets represented in a graph and your knowledge about Network Science, check t...
  • 5th quiz - 05/05/2023
    Given the following directed graph, if we executed Kosaraju-Sharir’s algorithm to detect the strongly connected components (SCCs) starting a...