Welcome to our Paris Route Finder Java project! This was developed for our Data Structures and Algorithms 2 assessment for the purpose of finding and visualizing paths between two specified points through the use of different search algorithms on a vector map of Paris.

• Search for routes between points/landmarks in Paris.

• Generate multiple route permutations using depth-first search (DFS).

• Find the shortest route using Dijkstra’s algorithm or breadth-first search (BFS).

• Discover the most cultural/historic route using Dijkstra’s algorithm.

• Customize routes by avoiding specific landmarks or adding waypoints.

• Use a user-friendly JavaFX graphical user interface with graphical feedback on the map

  
  

1. Launch the application and select a starting point and destination landmark from the list.
2. Choose your preferred search algorithm and customize your route if desired.
3. View the generated route on the map and explore additional features of the application.

1. Clone the repository:

   gh repo clone Ayyvah/ParisRouteFinder-DSACA2
   

• Ava Neary
• Fionn Reilly