{"id":21980243,"url":"https://github.com/parinaz11/neshan_project","last_synced_at":"2026-05-15T22:41:30.352Z","repository":{"id":214257941,"uuid":"536776573","full_name":"Parinaz11/Neshan_Project","owner":"Parinaz11","description":"Training a model to find the shortest path possible from the current location to a destination using data from Neshan company.","archived":false,"fork":false,"pushed_at":"2024-03-01T18:53:17.000Z","size":461,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-08-22T06:34:21.214Z","etag":null,"topics":["dijkstra-algorithm","dijsktra-shortest-path","jupyter-notebook","neshan-map","python","python3"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Parinaz11.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-09-14T22:15:57.000Z","updated_at":"2025-07-30T11:51:28.000Z","dependencies_parsed_at":"2025-01-28T04:35:21.102Z","dependency_job_id":null,"html_url":"https://github.com/Parinaz11/Neshan_Project","commit_stats":null,"previous_names":["parinaz11/neshan_project"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Parinaz11/Neshan_Project","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Parinaz11%2FNeshan_Project","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Parinaz11%2FNeshan_Project/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Parinaz11%2FNeshan_Project/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Parinaz11%2FNeshan_Project/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Parinaz11","download_url":"https://codeload.github.com/Parinaz11/Neshan_Project/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Parinaz11%2FNeshan_Project/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33082230,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-15T20:25:35.270Z","status":"ssl_error","status_checked_at":"2026-05-15T20:25:34.732Z","response_time":103,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["dijkstra-algorithm","dijsktra-shortest-path","jupyter-notebook","neshan-map","python","python3"],"created_at":"2024-11-29T17:10:10.865Z","updated_at":"2026-05-15T22:41:30.336Z","avatar_url":"https://github.com/Parinaz11.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Neshan Project\n\nThis 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.\n\nIn 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.\n\nUsing preprocessing, dijkstra's algorithm for graphs and training with evaluation, we were able to achieve reasonable results.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fparinaz11%2Fneshan_project","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fparinaz11%2Fneshan_project","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fparinaz11%2Fneshan_project/lists"}