MathJax


quinta-feira, 8 de setembro de 2022

Question 4 - Distances?

Given the directed and unweighted graph below, and supposing that we start in node 1:


Which of the following items gives the information about the Furthest Node and one of the Shortest Paths to the furthest Node?
  1. Furthest Node: \(8\) and Shortest Path: \(1 \to 2 \to 4 \to 7 \to 8\)
  2. Furthest Node: \(8\) and Shortest Path: \(1 \to 2 \to 6 \to 7 \to 8\)
  3. Furthest Node: \(9\) and Shortest Path: \(1 \to 2 \to 6 \to 7 \to 9\)
  4. Furthest Node: \(9\) and Shortest Path: \(1 \to 2 \to 4 \to 7 \to 8 \to 9\)
  5. None of the above.

  Original idea by: Pedro Henrique Di Francia Rosso

Nenhum comentário:

Postar um comentário

Question 12 - Dendrogram

Applying a divisive algorithm on the network below, we obtain the following dendrogram: Network  Dendrogram Looking at the dendrogram, we...