Bidirectional search - Simple English Wikipedia, the free encyclopedia

void bidirectionalSearch(Item a, Item b) {     Queue qA = new Queue();     Queue qB = new Queue();     qA.enqueue(a);     qB.enqueue(b);     while (!qA.isEmpty() && !qB.isEmpty()) {         if (!qA.isEmpty()) {             Item v = qA.dequeue();             if (aItem.found) return true;             for (Item neighbor : v.neighbors()) {                 if (!neighbor.found) {                     neighbor.found = true;                     qA.enqueue(neighbor);                 }             }         }         if (!qB.isEmpty()) {             Item v = qB.dequeue();             if (v.found) return true;             for (Item neighbor : v.neighbors()) {                 if (!neighbor.found) {                     neighbor.found = true;                     qB.enqueue(neighbor);                 }             }         }     }     return false; }