One of Houston's bigger problems is its traffic, especially in parking.
What it does
Uses multi-goal pathfinding with Dijkstra to route drivers to available parking spots.
How we built it
In about 900 lines of code, we used C++ and the SDL graphics library to visualize the routes to multiple goal locations in a dynamically changing environment of simulated real-time traffic
Challenges we ran into
Besides the obvious time constraints and lack of artistic talent, integrating the code of several programmers with different styles together proved more trouble than originially considered.