JavaFX route-finding application using custom graph data structures. Implemented DFS to generate multiple route permutations, BFS for fewest-stop routes, and Dijkstra’s algorithm (with optional line-change penalties) to calculate shortest paths. Integrated a GUI with map visualisation and route highlights.
Elijah-Destigni/Vienna-U-Bahn-Route-Finder
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|