DIJKSTRA’S

ALGORITHM
FOR
SHORTEST
ROUTES
 TABLE OF CONTENTS

INTRODUCTION ALGORITHM IMPLEMENTATION

Introduce the topic of 01 04 Here you could describe
the paper the topic of the section

LITERATURE REVIEW CONCLUSION

Overview of work, 02 05 Conclude and summarize
applied knowledge the paper

RESEARCH METHOD
Explain particularly about the 03 06 Q&A
way Dijkstra applied
 1
INTRODUCTION
 WHAT THE PAPER WAS WORKING ON

DIJKSTRA
ALGORITHM

COVID-19 VACCINATION SHORTEST

Outbreak in 2019 Vaccine places are vital
ROUTE
Visualized by
Google map
 2
LITERATURE
REVIEW
THE STUDY
Determining shortest path

PRESENT AN OPTIMIZATION Solve various problem

MODEL

Microsoft SQL server DBMS

OPTIMIZE THE PERFORMANCE to perform data processing,
MEASURE OF WAITING TIME data manipulation, also used
for graph
DETERMINE OPTIMAL
PLACE OF MEDICAL HUBS Use google maps to show
AND DISTRIBUTIONS OF routes and destinations
VACCINE

Use React Native to determine

distribution of Covid-19
 3
RESEARCH
METHODS
 3.RESEARCH METHODS

FIRST STAGE SECOND STAGE FINAL STAGE

To find out what It can be seen what From the

prospective users is needed from requirements

need from the prospective users is obtained, it can be

program the ease of finding concluded that

the shortest path to finding the shortest

vaccination site path can be done by

implementing the
Dijkstra algorithm
 3.RESEARCH METHODS

Program made in form of a website using HTML, Deployment stage, inputs obtained can help
CSS, and JavaScript develop this program in the future
Data from vaccination sites will be At maintainance stage, it is carried out
stored in the database on the program that has been made
This is done to fix errors that were
not detected in the previous stage
 3.1 ALGORITHM
There are several steps needed find
The shortest path including:
Create a table of distances between
vertices/edges and give the value of each of these edges,
the previous vertex, the visted vertex, and the current visited vertex.

The initial vertices are assigned a value of 0 as a staring point

Vertices that have been visited must be marked and cannot be visited again

Perform value calculations and updates the distance as well as the previous vertex list
Based on the vertex to be visited from the current vertex
Repeat the process that was done in the third step and so on until the vertices have
been visited
3.2 THE PROCESS 3.3 GRAPH
OF FINDING EXPLANATION
SHORTEST PATH FOR THE VACCINE SITE

Data

Destination Distance related data

starting point
3.4 DATABASE
 4
ALGORITHM
IMPLEMENTATION
 ALGORITHM IMPLEMENTATION

The
Display the implementation
A program closest path uses
produce to the vaccine Html, JavaScript,
in the form of site and Google maps
a website according to API to solve the
data vertex shortest path
and edges
 4.1 RESULT AND ANALYSIS

The entire path that was formed , it would

pass through buildings or structures that
should not be passed

Shortcomings where we had to enter From each vertex, a calculation will

each road turn as a vertex and an be carried out on each existing path
edge distance then be calculated using
Dijkstra algorithm to find the
shortest path
4.1 RESULT AND ANALYSIS
 5
CONCLUSIO
N
 5.CONCLUSION
The shortest path concentrates on
Finding the path with minimum distance

The shortest path from the source node

to another node, we can use Dijkstra algorithm
Dijkstra algorithm can help the
Community to find the closest location for
Covid-19 vaccine

In this study, initial location is limited

To the location has been inputted

For program development, initial location

can be developed into a “current location”
Program runs optimally
THE END
THE TEAM
Nguyễn Bình Khang (2152636)
Khang.nguyen1304@hcmut.edu.vn

Đàm Vĩnh Phát (2153675)

phat.damvinh@hcmut.edu.vn

Lê Hoàng Lâm (2153515)

lam.lehoang1811@hcmut.edu.vn

Lê Đăng Khôi (2153478)

khoi.lehcmut2003@hcmut.edu.vn

Hoàng Gia Bảo (2153199)

bao.hoangpetrus@hcmut.edu.vn
THANKS!
Q&A