A graph traversal algorithm that starts from both the source and destination nodes, and searches simultaneously until the two paths intersect, which is the shortest path.
A graph traversal algorithm that starts from both the source and destination nodes, and searches simultaneously until the two paths intersect, which is the shortest path.