>
> Actually, when using BFS it can be proved that such thing is
> not possible.
> Since BFS by definition finds the shortest path between the
> source and the
> destination than if a BFS on node A suggested a movement to
> node B and if
> the BFS on node B suggested a move to node A, then we could
> have saved two
> moves by staying at B, which contradicts the definition of BFS.
But he talked about a case when a user moves NOT according to the hint.
Received on Thu Feb 15 2001 - 01:45:25 IST