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

Comentários

Postar um comentário

Postagens mais visitadas deste blog

Questão - Semana 1

Questão 4 - Calculus