Algoritma Djikstra untuk Menentukan Rute Terpendek Objek Wisata di Kota Jambi

Abstract

Searching for the shortest route is a search for a route from one path to another to minimize the distance on a particular interconnected path. The Djikstra algorithm is an algorithm used to determine the shortest path from a certain point to every other point on a graph. The length of the shortest route traversed is: (1) Gentala Arasy Bridge (v1) → (v13) → (v19) → (v25) → (v32) → (v36) with a track length of 34.58 Km. (2) Siginjai Museum (v13) → (v19) → (v1) → (v25) → (v32) → (v36) with the length of the track traversed being 50.1 Km. (3) Kampoeng Radja (v19) → (v13) → (v1) → (v25) → (v32) → (v36) with the length of the track traversed being 45.96 Km. (4) Keris Monument Siginjai Jambi (v25) → (v32) → (v36) → (v19) → (v13)→ (v1) with the length of the path traversed is 49.92 Km. (5) Taman Rimba Zoo (v32) → (v36) → (v25) → (v19) → (v13)→ (v1) with the length of the path traversed is 44.24 Km. (6) Jambi Paradise Tourism Park (v36) → (v32) → (v25) → (v19) → (v13) → (v1) with a track length of 34.58 km.