If the shortest path exists, those two searches will meet at some node v. A shortest path from s to t consists of paths from s to v and from v to t.
Ako najkraći put postoji, ove dve pretrage će se sresti na istom čvoru v. Najkraći put od s do t sastoji se od puteva od s do v i od v do t.