Consider the following graph. Let the start vertex be r, and the goal vertex be rg....

 

Transcribed Image Text:

Consider the following graph. Let the start vertex be r, and the goal vertex be rg. Important: if a node has multiple outgoing edges, when the node is expanded the vertices adjacent to the node are processed in alphabetical order. Similarly, if multiple nodes in the OPEN queue have the same priority value, sort them by alphabetical order. A 2 1 7 B 4 E 8 1 F 3 H 1. Show how the algorithm plans a path from r, to . To display the various steps, follow exactly the same format used in the lecture notes (Example 4.4) and presented in class. 2. Show the tree produced by Dijkstra's algorithm at the end, together with the costs associated with each vertex. Consider the following graph. Let the start vertex be r, and the goal vertex be rg. Important: if a node has multiple outgoing edges, when the node is expanded the vertices adjacent to the node are processed in alphabetical order. Similarly, if multiple nodes in the OPEN queue have the same priority value, sort them by alphabetical order. A 2 1 7 B 4 E 8 1 F 3 H 1. Show how the algorithm plans a path from r, to . To display the various steps, follow exactly the same format used in the lecture notes (Example 4.4) and presented in class. 2. Show the tree produced by Dijkstra's algorithm at the end, together with the costs associated with each vertex.