Data Structures Final Group Project

At peak hours of bus/ride share services, passengers may be unevenly distributed between vehicles. This may cause congestion of traffic and increased wait times. We want to create a model that chooses personal vehicles for passengers based on the amount of passengers already in the vehicle and the distance that the vehicle has to travel for the destination (correlated with time spent travelling). This can be especially evident on the RTS bus system. With this model, an app/software could choose vehicles for passengers and create less congested and safer roads on campus.

Features Implemented: Interactive node placement Interactive edge placement Random node placement Random edge placement Random graph generator A* Pathfinding Dijkstra’s Algorithm Pathfinding Buttons to toggle features Interactive ride requests Random ride requests Variable vehicle capacity Variable animation speed Simulation with specified parameters including speed, probability and # of requests. Car display with car color, number, passenger count, and current station

By : Haroon Syed, Zack Allen, James Horn