Questão - Semana 1

 

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

Comentários

  1. Interesting question, but DFS visits all vertices exactly one time, regardless of the initial vertex. Also, you forgot to finish your questions with the phrase "Original idea by: ", followed by your name.

    ResponderExcluir

Postar um comentário

Postagens mais visitadas deste blog

Questão 2

Questão 4 - Calculus