feat(app.py): show result of path using both algorithms#43
Merged
ChronoInferna merged 1 commit intomainfrom Nov 4, 2025
Merged
feat(app.py): show result of path using both algorithms#43ChronoInferna merged 1 commit intomainfrom
ChronoInferna merged 1 commit intomainfrom
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This pull request adds support for comparing two different pathfinding algorithms—Dijkstra's algorithm and Breadth-First Search (BFS)—in both the backend and frontend of the application. Users can now see the results from both algorithms when searching for routes between airports.
Backend enhancements:
bfsalgorithm import and invocation alongsidedjikstrain bothwaypoint/main.pyandweb/app.py, allowing both algorithms to be run and compared for the same airport pair. [1] [2]/processroute to return results for both algorithms, including their respective flight paths and total travel times.Frontend improvements:
web/static/script.jsto display the routes and travel times found by both Dijkstra's and BFS algorithms, making it clear to the user how each algorithm performed.CLI demonstration:
main()function inwaypoint/main.pyto print out the paths and travel times for both algorithms for a sample route, aiding in debugging and demonstration.