hw4 - G K P S V Y Y S nil y nil nil K A B ∞ G ∞ V,6...

This preview shows pages 1–9. Sign up to view the full content.

A B G K P S V Y Cost Of Shortest Path From S to X Parent Of X Nodes Explored: { } 0 S, 0 Step 0 (Before While Loop) Nodes Unexplored: { A,B,G,K,P,S,V,Y } A B G K P S V Y nil nil nil nil nil nil nil nil A, B, G, K, P, V, Y,

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
A B G K P S V Y Cost Of Shortest Path From S to X Parent Of X Nodes Explored: { S } 0 Step 1 Nodes Unexplored: { A,B,G,K,P,V,Y } 7 2 A B G K P S V Y nil S nil S nil nil nil nil G, B, K,7 P, V, Y,2 A,
A B G K P S V Y Cost Of Shortest Path From S to X Parent Of X Nodes Explored: { S,Y } 0 Step 2 Nodes Unexplored: { A,B,G,K,P,V } 4 6 2 A B G K P S V Y Y S nil y nil nil nil nil A,4 B, K,6 P, V, G,

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
A B G K P S V Y Cost Of Shortest Path From S to X Parent Of X Nodes Explored: { S,Y,A } 0 Step 3 Nodes Unexplored: { B,G,K,P,V } 4 6 6 2 A B G K P S V Y Y S nil y nil nil nil A B, K,6 P, V,6 G,
A B G K P S V Y Cost Of Shortest Path From S to X Parent Of X Nodes Explored: { S,Y,A,K } 0 Step 4 Nodes Unexplored: { B,G,P,V } 4 6 11 6 2 A B

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: G K P S V Y Y S nil y nil nil K A B, ∞ G, ∞ V,6 P,11 A B G K P S V Y Cost Of Shortest Path From S to X Parent Of X Nodes Explored: { S,Y,A,K,V } Step 5 Nodes Unexplored: { B,G,P } 9 4 ∞ 6 7 6 2 A B G K P S V Y Y S nil y V nil V A B,9 P,7 G, ∞ A B G K P S V Y Cost Of Shortest Path From S to X Parent Of X Nodes Explored: { S,Y,A,K,V,P } Step 6 Nodes Unexplored: { B,G } 9 4 ∞ 6 7 6 2 A B G K P S V Y Y S nil y V nil V A B,9 G, ∞ A B G K P S V Y Cost Of Shortest Path From S to X Parent Of X Nodes Explored: { S,Y,A,K,V,P,B } Step 7 Nodes Unexplored: { G } 9 4 11 6 7 6 2 A B G K P S V Y Y S nil y V B V A G,11 A B G K P S V Y Cost Of Shortest Path From S to X Parent Of X Nodes Explored: { S,Y,A,K,V,P,B,G } Step 8 Nodes Unexplored: { } 9 4 11 6 7 6 2 A B G K P S V Y Y S nil y V B V A...
View Full Document

This note was uploaded on 11/10/2009 for the course CS 2223 taught by Professor Ruiz during the Fall '05 term at WPI.

Page1 / 9

hw4 - G K P S V Y Y S nil y nil nil K A B ∞ G ∞ V,6...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online