z-logo
open-access-imgOpen Access
Implementasi Algoritma Dijkstra untuk Pencarian Rute Terpendek Menuju Rumah Sakit pada Aplikasi C-Hos (Covid-19 Hospital)
Author(s) -
Muhammad Taufiq Ismail,
Septi Andryana,
Aris Gunaryati
Publication year - 2021
Publication title -
jurnal media informatika budidarma
Language(s) - English
Resource type - Journals
eISSN - 2614-5278
pISSN - 2548-8368
DOI - 10.30865/mib.v5i3.3077
Subject(s) - covid-19 , referral , medicine , dijkstra's algorithm , medical emergency , family medicine , shortest path problem , virology , computer science , infectious disease (medical specialty) , graph , disease , theoretical computer science , outbreak
Exactly on March 2, 2020, the corona virus (Covid-19) entered Indonesia. In Jakarta, there were 445,302 positive cases of Covid-19 as of June 12, 2021. The government itself has appointed Wisma Athletes as an emergency corona hospital and there are also several hospitals in Jakarta to serve as COVID-19 referral hospitals However, many people do not know the referral hospital for COVID-19. This is very unfortunate, because at any time people or residents who have shown symptoms of Covid-19 can immediately come to the nearest Covid-19 referral hospital. From this problem, an Android-based C-Hos (Covid-19 Hospital) application was created by applying the Dijkstra Algorithm to search for the shortest route to the covid-19 referral hospital. Based on the results of testing 20 times, the accuracy of the shortest route to the Covid-19 referral hospital on the C-Hos application is 100%.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom