Questão 3

 




Given the undirected graph bellow:

What is the distance from A to all nodes in this graph if we use a BFS algorithm starting from A?

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 - Null

d) A - 0, B - 1, C - 2, D - 1, E - 2, F - 2, H - 3, G - Null

e) None of the above







Comentários

  1. Joao Meidanis9 de setembro de 2024 às 15:20

    Dear João Augusto, nice question. It is a bit on the easy side, but I noticed we don't have yet a question on BFS where distances are computed, so I decided to take this question of yours.

    ResponderExcluir

Postar um comentário

Postagens mais visitadas deste blog

Questão - Semana 1

Imagem
  Observing the directed graph bellow From which vertices should the DFS start so that all vertices are visited at least once. a) 5 and 3 b) 4 and 2 c) 6 and 3 d) 6 and 2 e) none of the above
Leia mais

Questão 2

Select one correct alternative about the BFS algorithm:  a) BFS uses a stack to store the vertices to be explored. b) A BFS can be used to find a path from one vertex to another in an unweighted graph, but it does not guarantee that this path is the shortest possible. c) A BFS can be used in undirected unweighted graphs to determine the distance between an initial vertex and all other vertices that make up the same connected component. d) A BFS is used in weighted graphs to determine the shortest path between a vertex and all others. e) None of the above. Original idea by: João Augusto Ferreira de Moura
Leia mais

Questão 6

 In a network, degree correlation describes the tendency of nodes with similar degrees to connect with each other. Which of the following best describes a network with positive degree correlation ? A. High-degree nodes primarily connect with low-degree nodes, leading to a decentralized structure. B. High-degree nodes are more likely to connect with other high-degree nodes, creating tightly connected hubs. C. Low-degree nodes only connect to high-degree nodes, increasing network centralization. D. Low-degree nodes avoid connecting with both low- and high-degree nodes, making the network sparse. E. None of the above. Original idea by: João Augusto Ferreira de Moura
Leia mais