Using the Breath-First-Search (BFS) algorithm, how many nodes have a distance of 1, 2 and 3 from node A, respectively?



a) 2, 4, 3

b) 3, 3, 3

c) 3, 4, 2

d) 2, 3, 4

e) None of the above.


Original idea by: Matheus de Oliveira Saldanha




Comentários

Postar um comentário