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

Question 2 - What about Graphs?

  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