OptimizedDisney | Python solution to optimize traversal

OptimizedDisney is a Python library. OptimizedDisney has no bugs, it has no vulnerabilities and it has low support. However OptimizedDisney build file is not available. You can download it from GitHub.

A Python Solution to Theme Park Planning. Users can look at current wait times for different rides, receive an expected future wait time for rides based on past data, and get an optimized route for participating in their favorite rides in the least amount of time. The suggested route takes three factors into account: how long it would take for the user to walk to the line, how long the current and expected future line wait times are, and how long the ride itself takes to complete. Current wait times are taken by web scraping a travel website with Beautiful Soup, and walking distance is found using Google’s Distance Matrix API. A simple GUI showcasing the app was made using the Python library Tkinter. In the future, this application could be expanded to include an option to add fast passes into the calculations. Although we applied our program to Disneyworld’s Magic Kingdom, we believe that this program can be applied to any theme park that has enough data on its wait times.