I was asked for the explanation of how my algorithm works. I found in Wikipedia that it's called bidirectional search — but when I wrote the script i didn't know its name :) The idea is better explained in WP than I can do it here :)

I run two simultaneous searches: one forward from the source word, and one backward from the target word, and stop when the two trees meet.