Domanda di colloquio di DS-IQ
The most difficult question was to implement find the shortest path algorithm while traversing a graph.
Risposta di colloquio
Anonimo
5 ago 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.
Anonimo
I use a breath first algorithm to traverse the graph.