Djikstra Algorithm for Determine the Shortest Route of Tourism in the Jambi City

Searching for the shortest route is a search for a route from one path to anotherto minimize the distance on a certain path that is interconnected. The problemof finding the shortest path in a graph is one of the optimization problemsDijkstra’s algorithm is an algorithm used in determining the shortest path froma certain point to every other point in a graph. The length of the shortest pathis: (1) Gentala Arasy Bridge → Siginjai Museum → Kampoeng Radja → KerisSiginjai Monument Jambi → Taman Rimboo Zoo → Taman Wisata JambiParadise with a track length of 34.58 Km. (2) Siginjai Museum → KampoengRadja → Gentala Arasy Bridge → Keris Siginjai Monument Jambi → TamanRimba Zoo → Taman Wisata Jambi Paradise with a track length of 40.1 Km.(3) Kampoeng Radja → Museum Siginjai → Gentala Arasy Bridge → KerisSiginjai Monument Jambi → Tamam Rimba Zoo → Taman Wisata JambiParadise with a track length of 45.96. (4) Jambi Keris Siginjai Monument →Taman Rimba Zoo → Taman Wisata Jambi Paradise → Kampoeng Radja →Siginjai Museum → Gentala Arasy Bridge with a track length of 49.92 Km. (5)Taman Rimba Zoo → Taman Wisata Jambi Paradise → Keris SiginjaiMonument Jambi → Kampoeng Radja → Museum Siginjai → Gentala ArasyBridge with a track length of 44.24 Km. (6) Taman Wisata Jambi Paradise →Taman Rimba Zoo → Keris Siginjai Monument Jambi → Kampoeng RadjaJambi Siginjai Museum → Gentala Arasy Bridge with a track length of 34.58Km.