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…