-
Notifications
You must be signed in to change notification settings - Fork 1
Algorithm's to minimize cumulative wait time for passengers when routing from node A to node B. Implements Dijkstra's algorithm with linked lists to form the graph used for finding the shortest path in a weighted graph. Uses a semi-clever heuristic algorithm for choosing which rider to serve first given the current riders waiting to be picked up…
Erik-Koning/Uber-Passenger-Ride-Request-Handling-Algorithms
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
About
Algorithm's to minimize cumulative wait time for passengers when routing from node A to node B. Implements Dijkstra's algorithm with linked lists to form the graph used for finding the shortest path in a weighted graph. Uses a semi-clever heuristic algorithm for choosing which rider to serve first given the current riders waiting to be picked up…
Topics
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published