This preview shows pages 1–15. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: – Dequeue a vertex X from the queue – Set its Known to 1 – For each vertex Y that is adjacent to vertex X, • If vertex Y’s d v is infinity Set Y’s d v to (X’s d v + 1), Y’s p v to X and then enqueue vertex Y. CSC2100A Spring 20062007 5 GraphShortest path program CSC2100A Spring 20062007 6 Vertex A B C D E CSC2100A Spring 20062007 7 MapEntry & hash CSC2100A Spring 20062007 8 Get vertex CSC2100A Spring 20062007 9 Add Edge CSC2100A Spring 20062007 10 Print Path CSC2100A Spring 20062007 11 Clear all CSC2100A Spring 20062007 12 destruction CSC2100A Spring 20062007 13 Unweighted CSC2100A Spring 20062007 14 Process Request CSC2100A Spring 20062007 15 Sample main...
View
Full
Document
This note was uploaded on 12/28/2010 for the course CSC CSC1110 taught by Professor Cjyuan during the Fall '06 term at CUHK.
 Fall '06
 CJYuan

Click to edit the document details