In the A* algorithm function: I don't see any update path_length_cost. Or say about this step: **else if** $g(n{best})$ + c(n{best}, x) < g(x)$ **then**<br> update $x$'s backpointer to point to $n{best}$]<br>
In the A* algorithm function: I don't see any update path_length_cost. Or say about this step:$g(n{best})$ + c(n{best}, x) < g(x)$ then
$x$ 's backpointer to point to $n{best}$ ]
else if
update