Shortest path finding
13
꼭 꼭꼭 꼭꼭꼭꼭 꼭꼭 꼭꼭꼭꼭 꼭꼭 꼭꼭 꼭꼭꼭 꼭꼭꼭꼭꼭꼭꼭꼭꼭꼭꼭꼭
-
Upload
seong-namkoong -
Category
Education
-
view
386 -
download
0
description
다.
Transcript of Shortest path finding
꼭 알고 넘어가야 하는최단경로 탐색 방법
남궁성교통정보통합활용지원센터
DISTANCE
Euclidian Distance (L2)
Manhattan Distance (L1)
Dijkstra AlgorithmDijkstra Algorithm
Edsger Wybe Dijkstra, 1930~2002
1932 네덜란드 로테르담 출생 1952 네덜란드의 최초 프로그래머 철도지도에서 두 지점간 최단노선문제를
생각하다가 알고리즘 개발 1962 에인트호벤기술대학 수학교수 시험문제 : 철학자들의 저녁식사 1972 ACM 튜링상 “ 당신이 할 수 있는 것을 하라” 1984 오스틴 텍사스대학 전산학장 1999 은퇴 2002 암으로 네덜란드 집에서 72
세사망
빠른 길 찾기 (SPF)
77 88 99
44 55 66
11 22 33
출발
도착
11
44
22
22
11 66
11
11
2255
33 55
(0,0)(0,0) (4,1)(4,1)
(1,1)(1,1)
77 88 99
44 55 66
11 22 33
출발
도착
11
44
22
44
11 66
11
11
2255
33 55
(0,0)(0,0) (4,1)(4,1)
(1,1)(1,1) (3,4)(3,4)
(5,4)(5,4)
77 88 99
44 55 66
11 22 33
출발
도착
11
44
22
44
11 66
11
11
2255
33 55
(0,0)(0,0) (4,1)(4,1)
(1,1)(1,1) (3,4)(3,4)
(5,4)(5,4) (8,5)(8,5)
(4,5)(4,5)
77 88 99
44 55 66
11 22 33
출발
도착
11
44
22
44
11 66
11
11
2255
33 55
(0,0)(0,0) (4,1)(4,1)
(1,1)(1,1) (3,4)(3,4)
(5,4)(5,4) (8,5)(8,5)
(4,5)(4,5)
(5,2)(5,2)
(7,2) ?(7,2) ?
77 88 99
44 55 66
11 22 33
출발
도착
11
44
22
44
11 66
11
11
2255
33 55
(0,0)(0,0) (4,1)(4,1)
(1,1)(1,1) (3,4)(3,4)
(5,4)(5,4) (8,5)(8,5)
(4,5)(4,5)
(5,2)(5,2)
(6,6)(6,6)
77 88 99
44 55 66
11 22 33
출발
도착
11
44
22
44
11 66
11
11
2255
33 55
(0,0)(0,0) (4,1)(4,1)
(1,1)(1,1) (3,4)(3,4)
(5,4)(5,4) (8,5)(8,5)
(4,5)(4,5)
(5,2)(5,2)
(6,6)(6,6)
(6,7) ?(6,7) ?
(6,7)
77 88 99
44 55 66
11 22 33
출발
도착
11
44
22
44
11 66
11
11
2255
33 55
(0,0)(0,0) (4,1)(4,1)
(1,1)(1,1) (3,4)(3,4)
(5,4)(5,4)
(4,5)(4,5)
(5,2)(5,2)
(6,6)(6,6)(6,7)
(10,3) ?
77 88 99
44 55 66
11 22 33
출발
도착
11
44
22
44
11 66
11
11
2255
33 55
(0,0)(0,0) (4,1)(4,1)
(1,1)(1,1) (3,4)(3,4)
(5,4)(5,4)
(4,5)(4,5)
(5,2)(5,2)
(6,6)(6,6)(6,7)
(12,8) ?
77 88 99
44 55 66
11 22 33
출발
도착
11
44
22
44
11 66
11
11
2255
33 55
(0,0)(0,0) (4,1)(4,1)
(1,1)(1,1) (3,4)(3,4)
(5,4)(5,4)
(4,5)(4,5)
(5,2)(5,2)
(6,6)(6,6)(6,7)
경로비용 : 6
11최단경로 : 44 55 9966
![DESIGN AND IMPLEMENTATION OF MULTI-PARAMETER · Another shortest path algorithm is Floyd Warshall algorithm [2] for finding shortest path in a weighted graph with positive and negative](https://static.fdocuments.net/doc/165x107/5d0ff8fc88c993662b8b74c8/design-and-implementation-of-multi-another-shortest-path-algorithm-is-floyd.jpg)
