MathJax


Sunday, August 28, 2022

2022-142

Given the following undirected and unweighted graph:

  What is the length of the shortest path between nodes 1 and 7?

  1. 3
  2. 4
  3. 5
  4. 6
  5. None of the above.

  Original idea by: Pedro Henrique Di Francia Rosso

at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

2025-261

Consider a directed graph \(G\)   and the Kosaraju-Sharir's algorithm for finding strongly connected components (SCCs). Analyze the foll...

  • 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...