Let S Suppose We Have The Graph Below With The Following Heuristic Values H A 8 H B 10 H C 3 H D 4 H E 0 1 (42.11 KiB) Viewed 29 times
Let's suppose we have the graph below with the following heuristic values: h(A) = 8 h(B) = 10 h(C) = 3 h(D) = 4 h(E) = 0 - B 2 1 9 A 11 с 2 E 3 4 D We run A* on the graph above, starting at A and going to E. We break ties alphabetically.
Q3.2 0.1 Points What is the final path that A* returns? Format your answer as a space-separated list with NO commas or brackets, as in A B C D E. Enter your answer here Save Answer Q3.3 0.05 Points Over the course of the entire algorithm, which node(s) would Dijkstra's have visited that A* avoided visiting? A B с D E None of the above Save Answer
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!