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)

2023-228

A company launched a new gadget C to be produced globally for North American and South American markets. The company uses just-in-time as ...

  • 2022-174
    In the Non-linear preferential attachment, the preferential attachment probability becomes \( \Pi(k) \sim k^{\alpha} \). For a starting netw...
  • 2021-041
    Considering the following network and its partition in green and pink nodes: The modularity \( M \) of a partition can be computed using...
  • 2022-102
    Select the correct alternative based on the following statements: A very large network in the scale-free regime should have \( \langle k...