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-277

Consider the following example of a standard fully-connected Multilayer Perceptron (MLP), a type of artificial neural network. It has an inp...

  • 2024-248
      Consider the following networks:   Which of the following options correctly ranks these networks from  most  robust to  least  robust agai...
  • 2021-051
    Random networks evolve in a dynamic process when \( \langle k \rangle \) grows from 0 to infinity. They start with isolated nodes, which a...
  • 2023-221
    Which of the following statements correctly describes the robustness of scale-free networks? Scale-free networks are highly robust again...