Shortest Path with Bidirectional Search: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=Internal= * Shortest Path in a Graph") |
|||
| Line 1: | Line 1: | ||
=Internal= | =Internal= | ||
* [[Shortest_Path_in_a_Graph#Shortest_Path_Algorithms|Shortest Path in a Graph]] | * [[Shortest_Path_in_a_Graph#Shortest_Path_Algorithms|Shortest Path in a Graph]] | ||
=Overview= | |||
Bidirectional search can be used to find the shortest path between a source and a destination node. It operates by running two simultaneous breadth-first searches, one from each node. When their searches collide, we have found the shortest path. This algorithm is faster than the [[Breadth-First_Search-based_Shortest_Path_Algorithm|classic breadth-first search based shortest path]]. | |||
Revision as of 20:36, 9 November 2021
Internal
Overview
Bidirectional search can be used to find the shortest path between a source and a destination node. It operates by running two simultaneous breadth-first searches, one from each node. When their searches collide, we have found the shortest path. This algorithm is faster than the classic breadth-first search based shortest path.