Dijkstra算法寻找最短路径的完整源代码

(1) Find the shortest path from A to F:

Codes:









 !"#$%

&"&"&!'%%%%

2*.

()"

+

,"-.

34.

 5!,.

*1",*.

"167".

2".

()8

+

"-4>%.

?@?4.

@""-.

*1*&).

&;8

)<>%.A !"#.BB=



+

8CD,9:34>%.

8CD,9:,"->%.

8CD,9:5!,>&"&"&!'.

8CD,9:",*>"#00.

8CD,9:67">"#00.

2

E<6-)7,F=.

)<G?H<8CD,"-==.

)<>%.A8CD,"-.BB=

+

-)7,

E<6-)G,F?B=.

)<G?H<8CD,9:,"-==.

2

7,*)

)<>%.A8CD,"-.BB=

+

E<J  -(  *  -    )-  7,  GF?8C

)<@>%.@A@""-.@BB=

+

*)(

*&)><*1=-<K)<*==.

8CD,9:",*>*&).

$

"-4>%.

<I"-4=

+

E<&-*)G*F?@B=.

)<GG?H<*&)CD,"-=?H<*&)CD0*==.

47,-?8(

+

)  <*&)CD,"-  >>  8C

)<4>>8CD,"-=

+

E<3L        -  G      *?*&)C

D,"-=.

2

2

2

2

.

2

; 58?)--(

*>8CD,9:",*.

<*I>"#00=

+

*",>*CD",*.

<*=.

2

2

M