Bidirectional Search: Difference between revisions
Jump to navigation
Jump to search
Created page with "Bidirectional Search" |
No edit summary |
||
| Line 1: | Line 1: | ||
Bidirectional 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. | |||
Latest revision as of 06:43, 3 October 2020
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.