Penerapan Algoritma Dijkstra Dalam Pencarian Lintasan Terpendek Lokasi Perguruan Tinggi Favorit Kota Malang Berbasis Web
| Main Author: | Pratama, Pratama |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | eng |
| Terbitan: |
, 2010
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/58984/1/PENDAHULUAN.pdf http://eprints.umm.ac.id/58984/55/BAB%201.pdf http://eprints.umm.ac.id/58984/56/BAB%202.pdf http://eprints.umm.ac.id/58984/57/BAB%203.pdf http://eprints.umm.ac.id/58984/58/BAB%204.pdf http://eprints.umm.ac.id/58984/59/BAB%205.pdf http://eprints.umm.ac.id/58984/7/LAMPIRAN.pdf http://eprints.umm.ac.id/58984/8/POSTER.pdf http://eprints.umm.ac.id/58984/ |
Daftar Isi:
- The dijkstra algorithm is a method that is often used in solving a problem in finding the shortest path of a location. Malang is one of the education cities in Indonesia. Based on the Ministry of Research, Technology and Higher Education in 2018 there are 7 universities that are included in the top 100 universities in Indonesia. The large number of student enthusiasts who want to continue their high school in Malang has made the city of Malang attractive to newcomers from out of town or outside the island. Not a few also Malang became a city destination for high school students, as well as female students from outside the city in the context of study tour or comparative study. However, the number of public and private tertiary institutions where each tertiary institution differs from one another requires information about the location of a tertiary institution, as well as the form of roads that can provide information on the fastest path or path to the tertiary institution. Therefore this research was conducted in order to create a system that facilitates the search for the shortest path to the location of universities in the city of Malang web-based. The results of the search for the shortest path by the system will be compared with the results of calculating the shortest path of the dijkstra algorithm manually and also by comparison with other independent track search algorithms.