Tomás is a hungry cat who has been trying for several days to catch Jairo, a clever and elusive mouse. It happens that, in order to reach his burrow, Mouse Jairo can only traverse the path (directed graph in the image below) using the DFS algorithm, while Tomás can only follow the path using the BFS algorithm. Based on your knowledge of graph search algorithms, answer whether Jairo will manage to escape from Tomás or if he will end up becoming his lunch:
a) Jairo will reach the burrow before Tomás and escape.
b) Tomás will reach Jairo’s burrow before him and devour him.
c) Jairo will not be able to find his burrow.
d) Tomás will not be able to find Jairo’s burrow.
e) None of the above.
Original idea by: Pedro Pereira
Boa questão, só estou preocupado com a imagem escolhida. Trata-se de dois conhecidos personagens, que podem ter suas imagens protegidos por direitos legais. Onde você obteve esta imagem? ela pode ser usada sem pagamento de royalties?
ResponderExcluirPeguei uma imagem qualquer no Google. Agora não temos mais problema, fiz meu próprio desenho.
Excluir