A project that plots the transportation network of UNAM University, plots the network using Networkx and find the shortest path between nodes using Dijkstra algorithm. The aim of the project is to give the user the best combination walking/ bus riding in order to get the fastest route to a campus destination. The project takes into account factors such as : weather conditions, time, and the safety of the user (takes into account the hour and the destination as to minimize the risk of a possible negative outcome).
-
Notifications
You must be signed in to change notification settings - Fork 0
andresordorica/Redes_UNAM
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A project that plots the transportation network of UNAM University, plots the network using Networkx and find the shortest path between nodes using Dijkstra algorithm.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published