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)

2026-349

Prof. John was playing an RPG game with his students. He then shows this dice to them and says that it is a dodecahedron and we can represen...

  • 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-092
    Read the statements about clustering coefficient below: Local clustering coefficient measures the connectivity of a node to the rest of ...