Bidirectional A* Algorithm (Informed Search Informed Search)
Revision as of 11:32, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference == https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/EPP%20shortest%20path%20algorithms.pdf")
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