MathJax


Saturday, September 10, 2022

2022-154

Given the unoriented graph below, indicate the correct distances from node 1 to each node different from 1, in the numerical ascending order of nodes. Tip: you may use the BFS algorithm.



 

 
 
 

 

  1. 1, 2, 2, 3, 4, 4, 4
  2. 1, 2, 2, 4, 4, 4, 4
  3. 1, 1, 2, 2, 3, 3, 3
  4. 2, 2, 3, 3, 3, 4, 4
  5. None of the above.
Original idea by: André Nóbrega
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...
  • 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...
  • 2022-125
    Social networks display an assortative behavior. In the friendship network below, consider that John and Karen want to make new friends. ...