Say I have a directed graph with a source and destination node s and t and I want to see if there's a path that exists between those two nodes.
Intuitively I would think that the fastest way to do this is to traverse forward from s while backtracking from t at the same time. If any nodes collide then you have a path. Most algorithms I see just say to use a breadth first search from s. Wouldn't my "double ended search" be faster?
Does an algorithm like this exist?