Given the following undirected and unweighted graph:
What is the length of the shortest path between nodes 1 and 7?
- 3
- 4
- 5
- 6
- None of the above.
Original idea by: Pedro Henrique Di Francia Rosso
Assinar:
Postar comentários (Atom)
Question 12 - Dendrogram
Applying a divisive algorithm on the network below, we obtain the following dendrogram: Network Dendrogram Looking at the dendrogram, we...
Nice question! I'll take it.
ResponderExcluirThanks professor.
ResponderExcluir