MathJax


Monday, September 9, 2024

2024-236

Given the undirected graph bellow:


What is the distance from A to all nodes in this graph?

a) A - 0, B - 1, C - 2, D - 1, E - 2, F - 3, H - 4, G - 0

b) A - 0, B - 1, C - 2, D - 1, E - 2, F - 2, H - 3, G - 4

c) A - 0, B - 1, C - 2, D - 1, E - 2, F - 2, H - 3, G - unreachable

d) A - 0, B - 1, C - 2, D - 1, E - 2, F - 3, H - 2, G - unreachable

e) None of the above


Original idea by: João Augusto 
at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

2024-241

Consider a particle moving in a one dimensional space. Its acceleration is proportional to the square of its velocity. Also, at \( t=0 \), i...

  • 2021-041
    Considering the following network and its partition in green and pink nodes: The modularity \( M \) of a partition can be computed using...
  • 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...