https://github.com/parinaz11/neshan_project
Training a model to find the shortest path possible from the current location to a destination using data from Neshan company.
https://github.com/parinaz11/neshan_project
dijkstra-algorithm dijsktra-shortest-path jupyter-notebook neshan-map python python3
Last synced: about 1 month ago
JSON representation
Training a model to find the shortest path possible from the current location to a destination using data from Neshan company.
- Host: GitHub
- URL: https://github.com/parinaz11/neshan_project
- Owner: Parinaz11
- Created: 2022-09-14T22:15:57.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-03-01T18:53:17.000Z (about 1 year ago)
- Last Synced: 2025-01-28T04:25:49.262Z (3 months ago)
- Topics: dijkstra-algorithm, dijsktra-shortest-path, jupyter-notebook, neshan-map, python, python3
- Language: Jupyter Notebook
- Homepage:
- Size: 450 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Neshan Project
This is the final project for my data science course. This project was assigned to us with the help of a Persian app called Neshan (similar to Google Maps) in which the user can get the shortest paths by giving their current location and destination.
In this project we were given a csv file conatining data with features such as weather, holiday, speed, etc and a graph containing the information for street lengths in a city. The goal was to train a model with which we can predict the shortest path possible from one location to another by having the info for those features.
Using preprocessing, dijkstra's algorithm for graphs and training with evaluation, we were able to achieve reasonable results.