Bidirectional A* Algorithm (Informed Search Informed Search)
Jump to navigation
Jump to search
Time Complexity
$O(b^{(d/{2})})$
Space Complexity
$O(b^{(d/{2})$})
(Stores all generated nodes in memory)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
2007