Download - Shortest path finding
![Page 1: Shortest path finding](https://reader034.vdocuments.us/reader034/viewer/2022052307/558c8b87d8b42a63678b4656/html5/thumbnails/1.jpg)
꼭 알고 넘어가야 하는최단경로 탐색 방법
남궁성교통정보통합활용지원센터
![Page 2: Shortest path finding](https://reader034.vdocuments.us/reader034/viewer/2022052307/558c8b87d8b42a63678b4656/html5/thumbnails/2.jpg)
![Page 3: Shortest path finding](https://reader034.vdocuments.us/reader034/viewer/2022052307/558c8b87d8b42a63678b4656/html5/thumbnails/3.jpg)
DISTANCE
Euclidian Distance (L2)
Manhattan Distance (L1)
![Page 4: Shortest path finding](https://reader034.vdocuments.us/reader034/viewer/2022052307/558c8b87d8b42a63678b4656/html5/thumbnails/4.jpg)
Dijkstra AlgorithmDijkstra Algorithm
Edsger Wybe Dijkstra, 1930~2002
1932 네덜란드 로테르담 출생 1952 네덜란드의 최초 프로그래머 철도지도에서 두 지점간 최단노선문제를
생각하다가 알고리즘 개발 1962 에인트호벤기술대학 수학교수 시험문제 : 철학자들의 저녁식사 1972 ACM 튜링상 “ 당신이 할 수 있는 것을 하라” 1984 오스틴 텍사스대학 전산학장 1999 은퇴 2002 암으로 네덜란드 집에서 72
세사망
![Page 5: Shortest path finding](https://reader034.vdocuments.us/reader034/viewer/2022052307/558c8b87d8b42a63678b4656/html5/thumbnails/5.jpg)
빠른 길 찾기 (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)
![Page 6: Shortest path finding](https://reader034.vdocuments.us/reader034/viewer/2022052307/558c8b87d8b42a63678b4656/html5/thumbnails/6.jpg)
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)
![Page 7: Shortest path finding](https://reader034.vdocuments.us/reader034/viewer/2022052307/558c8b87d8b42a63678b4656/html5/thumbnails/7.jpg)
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)
![Page 8: Shortest path finding](https://reader034.vdocuments.us/reader034/viewer/2022052307/558c8b87d8b42a63678b4656/html5/thumbnails/8.jpg)
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) ?
![Page 9: Shortest path finding](https://reader034.vdocuments.us/reader034/viewer/2022052307/558c8b87d8b42a63678b4656/html5/thumbnails/9.jpg)
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)
![Page 10: Shortest path finding](https://reader034.vdocuments.us/reader034/viewer/2022052307/558c8b87d8b42a63678b4656/html5/thumbnails/10.jpg)
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)
![Page 11: Shortest path finding](https://reader034.vdocuments.us/reader034/viewer/2022052307/558c8b87d8b42a63678b4656/html5/thumbnails/11.jpg)
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) ?
![Page 12: Shortest path finding](https://reader034.vdocuments.us/reader034/viewer/2022052307/558c8b87d8b42a63678b4656/html5/thumbnails/12.jpg)
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) ?
![Page 13: Shortest path finding](https://reader034.vdocuments.us/reader034/viewer/2022052307/558c8b87d8b42a63678b4656/html5/thumbnails/13.jpg)
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