Project Background
Shortest Path algorithm is an algorithm that find the shortest distance between two location. It will calculate the shortest path within many directions. There are many algorithms that find shortest path such as Dijkstra algorithm, Manhattan Distance heuristic, K*, A* and others.
Most Preferred Clinic Using Suitable Shortest Path Algorithm is an application that used to implement the suitable shortest path algorithm. It was developed based on the researches that has been made. It allow user to find the shortest path to a clinic in the area. In this situation, the starting point and the destination must been determined. The process will starts from starting point and then explore the nodes to determine the shortest path until it reaches the destination. This application will be developed to demonstrate the suitable shortest path algorithm that it can be used to determine the shortest path in the area. Each path travelled will be calculated. Using this application, the user can easily find the shortest path to the clinic in area and in timely mannered. It will calculate the shortest time to go to the clinic that the user have select and also the time taken for a check-up to be done. The time taken for a check-up to be done is depend on the seriousness of injury or sickness. As an example, if the user's child have a high fever, this application will show the nearest clinic with a few detail about it such as how many patient were being treated at that time and how long does it take to check-up for the high fever. If the clinic is busy at that particular time, the application will give another option to the user or the user can choose another option. The user will no longer used old methods to compute each path. The user have to insert the location manually and it will calculate the distance. The user will choose the clinic based on the clinic detail that will be shown. The detail include all the information regarding about the clinic.
The criteria for this application is it will consider the speed of the vehicle, the distance from starting point to the end point, the number of patient and the time taken for check-up.
The process of this application is it will use the speed of the vehicle to determine the time arriving at the clinic. If the vehicle move faster, the time taken to arrive will be shorten. Thus, the speed of the vehicle is crucial in this part. The time for a check-up to be done also displayed on the interface of the application.
Most Preferred Clinic Using Suitable Shortest Path Algorithm is an application that used to implement the suitable shortest path algorithm. It was developed based on the researches that has been made. It allow user to find the shortest path to a clinic in the area. In this situation, the starting point and the destination must been determined. The process will starts from starting point and then explore the nodes to determine the shortest path until it reaches the destination. This application will be developed to demonstrate the suitable shortest path algorithm that it can be used to determine the shortest path in the area. Each path travelled will be calculated. Using this application, the user can easily find the shortest path to the clinic in area and in timely mannered. It will calculate the shortest time to go to the clinic that the user have select and also the time taken for a check-up to be done. The time taken for a check-up to be done is depend on the seriousness of injury or sickness. As an example, if the user's child have a high fever, this application will show the nearest clinic with a few detail about it such as how many patient were being treated at that time and how long does it take to check-up for the high fever. If the clinic is busy at that particular time, the application will give another option to the user or the user can choose another option. The user will no longer used old methods to compute each path. The user have to insert the location manually and it will calculate the distance. The user will choose the clinic based on the clinic detail that will be shown. The detail include all the information regarding about the clinic.
The criteria for this application is it will consider the speed of the vehicle, the distance from starting point to the end point, the number of patient and the time taken for check-up.
The process of this application is it will use the speed of the vehicle to determine the time arriving at the clinic. If the vehicle move faster, the time taken to arrive will be shorten. Thus, the speed of the vehicle is crucial in this part. The time for a check-up to be done also displayed on the interface of the application.
Expected Outcome
The expected outcome for this application is the user can easily find the nearest clinic in an area. The user also can choose to go to government or private clinics. With this application also the user know how long for a check-up to be done.
Student Profile
- Name : Nur Dinie Nasuha Binti Zahari
- Matric Number : BTBL15039901
- Supervisor : Dr. Ahmad Nazari Bin Mohd Rose
- Email : [email protected]
- Contact : 017-9343052
- Institution : Universiti Sultan Zainal Abidin
- Course : Bachelor of Computer Science in Computer Network Security (with Honors)