Different versions of the Dijkstra algorithm were used to solve the various problems. We also focused on the speed and efficiency of the algorithm. Due to the huge nature of the dataset, we converted the data into dictionaries modified to extract the exact info that were needed and these were then saved in the Dictionaries directory. Easy and fast data extraction merged with the most efficient algorithm results in high speed output.
Step 1: Run a program file of any of the Problem directory. Then input a source and a destination latitude, longtitude pair.
Step 2: The program will output a kml file and a Textual desciption file.(according to the rules specified in the given problemset)
Step 3: Use the kml file to get the route in Google maps or OpenStreetMap and the Textfile contains basic guidelines for the routes.
Here is an example route :
.PNG)
Team Name : Team BUET Obliviate
Team Members :
1. Md. Zarif Ul Alam ; ID : 1705010
2. Najibul Haque Sarker ; ID : 1705044
3. Apurba Saha ; ID : 1705056
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent