Analysis of Algorithms : An Active Learning Approach

276 APPENDIX C

Dijkstra’s shortest-path algorithm

2

A B C D

E F G H

I J K L

12

1

A B C D

E F G H

I J K L

21

14

4

3 4

2

3 2 2

3

333

3

9

5

8

C

E

I

B

A

(^32)
7
1
8 I
C
F
B E
A
3
1
(^23)
8
(^7) F
D
G
(^8) I
B
E C
A
3
1
8
2
7
I
C
F
B
E
A