Your SlideShare is downloading. ×
Dijkstra Algorithm
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×

Introducing the official SlideShare app

Stunning, full-screen experience for iPhone and Android

Text the download link to your phone

Standard text messaging rates apply

Dijkstra Algorithm

928
views

Published on

Published in: Technology

0 Comments
1 Like
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total Views
928
On Slideshare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
0
Comments
0
Likes
1
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. 2 3 4 5 6 2 2 6 4 5 4 2 未確定ノードへの距離は 5, 4, 2 しかないのでこのノードへの距離が 2 よりも少ない経路は見つかりようがない。よって ( スタートからの ) 最小コストが確定。 2 + 6 = 8 2 + 3 = 5 4 + 2 = 6 4 + 2 = 6 5 + 6 = 11 6 + 4 = 10 ダイクストラ法 c.f: http://www.deqnotes.net/acmicpc/dijkstra/ 0