Suppose you use a stack instead of a queue when running breadth-first search. Does it still compute shortest paths?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.