GitHub - Erik-Koning/Uber-Passenger-Ride-Request-Handling-Algorithms: 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, and their requested destination travel time that would be required.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
LICENSE.md		LICENSE.md
UberProject_15ek2.c		UberProject_15ek2.c
graph.h		graph.h
intqueue.h		intqueue.h
newnetwork.csv		newnetwork.csv
newrequests.csv		newrequests.csv
outputData.csv		outputData.csv
outputData_15ek2.xlsx		outputData_15ek2.xlsx
uberRequirements.PNG		uberRequirements.PNG
weirdset.csv		weirdset.csv

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…

cmpe365