ShortestPath

ALGORITHM SHORTEST PATH  50 10 B F 20 40 A 50 C 10 10 20 80 90 E 30 20 H D G 20  F 10 B 50 1 20 10 40 A C 50 90 D 20 E 20 20 30 G B A 20 A C D 80 A E F G 90 A A(20) = A(0) + B(20) D(80) = A(0) + D(80) G(90) = A(0) + G(90) 10 80 A H H  F 10 B 20 10 A C D 20 20 20 G D E F G 1 A 20 A 80 A 90 A 2 B 20 A 80 A 30 90 B A F(30) = A(20) + B(10) 50 30 C 10 80 E B 50 40 90 A H H  F 10 B 20 A B 1 A 20 A 80 A 90 A 2 B 20 A 80 A 30 90 B A 3 F 20 40 70 A F F 30 90 B A 50 10 40 A C 10 80 C D E F G 50 90 D 20 E 20 20 30 G H C(40) = A(20) + B(10) + F(10) D(70) = B(20) + F(10) + D(40) H  F 10 B 20 10 A C 10 80 50 20 20 30 G C D E F G H 1 A 20 A 80 A 90 A 2 B 20 A 80 A 30 90 B A 3 F 20 40 70 A F F 30 90 B A 4 C 20 40 50 A F C 30 90 60 B A C D 20 E B 50 40 90 A H D(50) = A(20) + B(10) + F(10) + C(10) H(60) = A(20) + B(10) + F(10) + C(20)  F 10 B 20 10 A C 10 80 50 D 20 E G 1 A 20 A 80 A 90 A 2 B 20 A 80 A 30 90 B A 3 F 20 40 70 A F F 30 90 B A 4 C 20 40 50 A F C 30 90 60 B A C 5 D 20 40 50 A F C 30 70 60 B D C 20 20 30 B 50 40 90 A H C D E F G H G(70) = A(20)+B(10)+F(10)+C(10)+D(20)  F 10 B 20 10 A C 10 80 50 D 20 E G 1 A 20 A 80 A 90 A 2 B 20 A 80 A 30 90 B A 3 F 20 40 70 A F F 30 90 B A 4 C 20 40 50 A F C 30 90 60 B A C 5 D 20 40 50 A F C 30 70 60 B D C 6 H 20 40 50 A F C 30 70 60 B D C 20 20 30 B 50 40 90 A H C D E F G H H(60) = A(20) + B(10) + F(10) + C(20)  F 10 B 20 10 A C 10 80 50 D 20 E G 1 A 20 A 80 A 90 A 2 B 20 A 80 A 30 90 B A 3 F 20 40 70 A F F 30 90 B A 4 C 20 40 50 A F C 30 90 60 B A C 5 D 20 40 50 A F C 30 70 60 B D C 6 H 20 40 50 A F C 30 70 60 B D C 7 G 20 40 50 A F C 30 70 60 B D C 20 20 30 B 50 40 90 A H C D E F G H G(70) = A(20)+B(10)+F(10)+C(10)+D(20)