Pergunta de entrevista da empresa DS-IQ
The most difficult question was to implement find the shortest path algorithm while traversing a graph.
Resposta da entrevista
Sigiloso
5 de ago. de 2016
I use a breath first algorithm to traverse the graph.
The most difficult question was to implement find the shortest path algorithm while traversing a graph.
Sigiloso
I use a breath first algorithm to traverse the graph.