?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=PERBANDINGAN+ALGORITMA+DIJKSTRA%0D%0ADAN+ALGORITMA+FLOYD+WARSHALL+UNTUK%0D%0AMENENTUKAN+RUTE+TERPENDEK+ANTAR+RUMAH+SAKIT%0D%0ADI+BEBERAPA+KOTA+DI+PROVINSI+LAMPUNG&rft.creator=ALENIA+DAYNUR+%2C+PUTRIANI&rft.subject=500+ilmu+pengetahuan+alam+dan+matematika&rft.subject=510+Matematika&rft.description=Determining+the+shortest+route+from+one+node+to+another+node+is+a+problem+that+we+often+encounter+in+everyday+life.+The+routes+obtained+are+intended+to+minimize+costs%2C+travel+time+or+distance.+In+this+study+we+will+compare+Dijkstra+and+Floyd+Warshall+Algorithm+to+determine+the+shortest+route+between+hospitals+in+some+cities+in+Lampung+Province.+The+efficiency+of+the+two+algorithms+in+solving+this+problem+were+assessed+based+on+the+program%E2%80%99s+running+time.+The+results+obtained+show+that+both+Dijkstra+Algorithm+and+Floyd+Warshall+Algorithm+provided+the+shortest+path+in+the+same+distance.+However%2C+the+running+time+of+Dijkstra+Algorithm+took+less+time+than+Floyd+Warshall+Algorithm.%0D%0AKey+Words%3A+Shortest+Path%2C+Dijkstra+Algorithm%2C+Floyd+Warshall+Algorithm%2C+Running+Time.%0D%0APenentuan+rute+terpendek+dari+satu+titik+ke+titik+yang+lain+merupakan+masalah+yang+sering+kita+jumpai+dalam+kehidupan+sehari-hari.+Rute+yang+diperoleh+ditujukan+untuk+meminimumkan+biaya+atau+waktu+tempuh+maupun+jarak.+Pada+skripsi+ini+akan+didiskusikan+perbandingan+Algoritma+Dijkstra+dan+Algoritma+Floyd+Warshall+untuk+menentukan+rute+terpendek+antar+rumah+sakit+di+beberapa+kota+di+Provinsi+Lampung.+Keefisienan+dari+kedua+algoritma+yang+digunakan+dalam+menyelesaikan+masalah+ini+dikaji+berdasarkan+lamanya+waktu+running+time+program.+Hasil+yang+diperoleh+menunjukkan+Algoritma+Dijkstra+dan+Algoritma+Floyd+Warshall+memberikan+rute+terpendek+dengan+jarak+yang+sama.+Namun+jika+dibandingkan+dengan+hasil+running+time+program%2C+Algoritma+Dijkstra+memiliki+waktu+lebih+singkat+dibandingkan+Algoritma+Floyd+Warshall.%0D%0AKata+Kunci%3A+Rute+Terpendek%2C+Algoritma+Dijkstra%2C+Algoritma+Floyd+Warshall%2C+Running+Time.&rft.publisher=FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM&rft.date=2023-06-12&rft.type=Skripsi&rft.type=NonPeerReviewed&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F74101%2F1%2FABSTRAK.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F74101%2F2%2FSKRIPSI%2520FULL.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F74101%2F3%2FSKRIPSI%2520TANPA%2520BAB%2520PEMBAHASAN.pdf&rft.identifier=++ALENIA+DAYNUR+%2C+PUTRIANI++(2023)+PERBANDINGAN+ALGORITMA+DIJKSTRA+DAN+ALGORITMA+FLOYD+WARSHALL+UNTUK+MENENTUKAN+RUTE+TERPENDEK+ANTAR+RUMAH+SAKIT+DI+BEBERAPA+KOTA+DI+PROVINSI+LAMPUNG.++FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM%2C+UNIVERSITAS+LAMPUNG.+++++&rft.relation=http%3A%2F%2Fdigilib.unila.ac.id%2F74101%2F