Graph algorithms

 

Considering the graph below and using the Kosaraju-Sharir algorithm, in alphabetical order, we can determine which of the following statements are correct:]


A) 1 SCCs returned: BED

B) 4 SCCs returned: A first, then BED, C, and F

C) 4 SCCs returned: F first, then C, BED, and A

D) The largest SCC contains 2 nodes

E) None of the above.


Original idea by: Caroline Nakazato

Comentários

Postar um comentário

Postagens mais visitadas deste blog

Random network

Which of the following statements regarding random networks is true? I. Real networks follow the same properties as random networks. II. The exact degree of distribution of a random network is calculated by the binomial distribution. The binomial distribution depends only on one parameter, <k>. III. An approximate way to calculate the degree of distribution of a random network is through the Poisson distribution. To make this approximation, the value of N must be large and the value of the probability p must be small. IV. The Poisson distribution depends only on one parameter <k>, while the Binomial distribution depends on p and N. A. All of the above B. II and III C. III and IV D. III E. None of the above Original idea by: Caroline Nakazato
Leia mais

Albert-Barabasi Model

Using the Albert-Barabasi model, what will be the initial number of links at time step 6,084 and a degree 5 node has been added at time 169? A. 30 B. 25 C. 35 D. 50 E. None of the above Original idea by: Caroline Nakazato 
Leia mais

Cupuaçu cake using topological sorting

Let's make a cupuaçu cake using topological sorting (in alphabetical order). What will be the the first ingredient to be mixed? INGREDIENTS 1 1/2 cups of Cupuaçu pulp 2 cups of Milk  3 cups of Cream 2 1/2 cups of Sugar 1 cup of Butter 5 Eggs 4 cups of Flour  1 tablespoon of Baking powder PREPARATION Milk -> Cream Cupuaçu pulp -> Cream Sugar -> Eggs Cream -> Eggs Butter -> Eggs Eggs -> Flour Flour -> Baking powder  Chose the right answer. A. Sugar B. Butter C. Milk D. Cupuaçu pulp E. None of the above.
Leia mais