Finding the Nearest Blood Donors using Dijkstra Algorithm
Now-a-days frequent mishaps like the road accident or other life-risking accident leading to operational emergencies are increasing day by day and the blood donor for such victims or patients are very hard to find in a short period. Sometimes it is really tough to collect the blood of the same group...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Soegijapranata Catholic University
2019-01-01
|
Series: | SISFORMA |
Subjects: | |
Online Access: | http://journal.unika.ac.id/index.php/sisforma/article/view/1709 |
id |
doaj-f30b46d2c0df49008f6481bc59e8f373 |
---|---|
record_format |
Article |
spelling |
doaj-f30b46d2c0df49008f6481bc59e8f3732020-11-24T22:52:31ZengSoegijapranata Catholic UniversitySISFORMA2355-82532442-78882019-01-0152404410.24167/sisforma.v5i2.1709857Finding the Nearest Blood Donors using Dijkstra AlgorithmMd. Sabir Hossain0Nayan Das1Muhammad Kamrul Hossain Patwary2Md. Al-Hasan3Department of Computer Science and Engineering Chittagong University of Engineering and TechnologyDepartment of Computer Science and Engineering Chittagong University of Engineering and TechnologyDepartment of Computer Science and Engineering Chittagong University of Engineering and TechnologyDepartment of Computer Science and Engineering Bangladesh Army University of Science and TechnologyNow-a-days frequent mishaps like the road accident or other life-risking accident leading to operational emergencies are increasing day by day and the blood donor for such victims or patients are very hard to find in a short period. Sometimes it is really tough to collect the blood of the same group from the relatives of a patient in dying moments. The main objective of this work is to make a connection with these two groups who are in need of blood and who are willing to donate. We have determined the shortest distance between blood seeker and blood donors using the Dijkstra Algorithm. Anybody can contact the nearest blood donor of any group in a particular area quickly. By implementing this idea, the harassment of the victim can be lessened and so many lives can be saved.http://journal.unika.ac.id/index.php/sisforma/article/view/1709Blood donor, Blood Seeker, Dijkstra’s algorithm, Shortest path, Nearest Donor |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Md. Sabir Hossain Nayan Das Muhammad Kamrul Hossain Patwary Md. Al-Hasan |
spellingShingle |
Md. Sabir Hossain Nayan Das Muhammad Kamrul Hossain Patwary Md. Al-Hasan Finding the Nearest Blood Donors using Dijkstra Algorithm SISFORMA Blood donor, Blood Seeker, Dijkstra’s algorithm, Shortest path, Nearest Donor |
author_facet |
Md. Sabir Hossain Nayan Das Muhammad Kamrul Hossain Patwary Md. Al-Hasan |
author_sort |
Md. Sabir Hossain |
title |
Finding the Nearest Blood Donors using Dijkstra Algorithm |
title_short |
Finding the Nearest Blood Donors using Dijkstra Algorithm |
title_full |
Finding the Nearest Blood Donors using Dijkstra Algorithm |
title_fullStr |
Finding the Nearest Blood Donors using Dijkstra Algorithm |
title_full_unstemmed |
Finding the Nearest Blood Donors using Dijkstra Algorithm |
title_sort |
finding the nearest blood donors using dijkstra algorithm |
publisher |
Soegijapranata Catholic University |
series |
SISFORMA |
issn |
2355-8253 2442-7888 |
publishDate |
2019-01-01 |
description |
Now-a-days frequent mishaps like the road accident or other life-risking accident leading to operational emergencies are increasing day by day and the blood donor for such victims or patients are very hard to find in a short period. Sometimes it is really tough to collect the blood of the same group from the relatives of a patient in dying moments. The main objective of this work is to make a connection with these two groups who are in need of blood and who are willing to donate. We have determined the shortest distance between blood seeker and blood donors using the Dijkstra Algorithm. Anybody can contact the nearest blood donor of any group in a particular area quickly. By implementing this idea, the harassment of the victim can be lessened and so many lives can be saved. |
topic |
Blood donor, Blood Seeker, Dijkstra’s algorithm, Shortest path, Nearest Donor |
url |
http://journal.unika.ac.id/index.php/sisforma/article/view/1709 |
work_keys_str_mv |
AT mdsabirhossain findingthenearestblooddonorsusingdijkstraalgorithm AT nayandas findingthenearestblooddonorsusingdijkstraalgorithm AT muhammadkamrulhossainpatwary findingthenearestblooddonorsusingdijkstraalgorithm AT mdalhasan findingthenearestblooddonorsusingdijkstraalgorithm |
_version_ |
1725665769589571584 |