Bidirectional Search

From Wiki :-)

Jump to navigation Jump to search

Bidirectional Search is an algorithm that finds the shortest path between two nodes.

It uses two BFS from each node until they collide. This algorithm is faster than BFS.

Retrieved from "https://wiki.georges.savound.com/index.php?title=Bidirectional_Search&oldid=969"