This program's purpose is to find routes between common tourist destinations in Paris.

The user can configure their own points or use the ones included with the project,
and then remove the top two lines of the UI once they have configured the map.

Remove the debug UI by commenting out lines 52-71 and 82-93 in 'main-view.fxml' and line 134 in MainViewController.

To add points to the map, go to the initialize() method in MainViewController and uncomment addPoints().

Run the program and use left click and copy-paste the console output into the
ParisLandmarkDatabase.csv file (on the line above 'Links,') to place a node on the map after configuring the following options.

To add edges, enter the node name and press 'show all possible edges for node', and copy-paste the desired edges from the console output into the ParisLandmarkDatabase.csv file (at the bottom of the file).

• Name - Name of the new node on the map.
  
• Year - Year the node on the map was constructed
  
• Type - The node's type - a tourist landmark or a junction.
  
• Image Path - The image to represent the node on the map, images/junction.png and images/landmark.png are used for junctions and landmarks, respectively.
  

• Node name - The node to show all possible edges for.
  
• Show All Possible Edges for Node - Press this to print out every possible connection this node could have with other nodes.
  
• Connect All Edges - View all connections between nodes on the map.
  

• Show Route (Depth-First) - Finds a route from the starting route to the destination route (including waypoints) using depth-first search.
  
• Show All Routes (Depth-First) - Find every route from the starting route to the destination route (including waypoints) using depth-first search, depending on number of routes.
  

• Get Shortest Path (Dijkstra's Algorithm) - Finds the shortest path between the starting node and the ending node (accounting for waypoints) with Dijkstra's algorithm.
  

• Set Waypoint - Forces routes to visit a specific node on the map.
  
• Avoid Waypoint - Forces routes to avoid a specific node on the map.
  
• Clear Waypoints - Removes all waypoints. You can see current waypoints in the list beneath the waypoint buttons.
  

• Start - Choose the starting node.
  
• Destination - Choose the node to end the route on.
  

• Shortest -> Historical Slider - Makes Dijkstra's algorithm priortise visiting old landmarks (earliest year)
  over shorter distance paths, depending on the position of the slider.
  The closer to shortest path the slider is, the more the algorithm will prioritise shortest distance, and vice versa.

• Waypoint - The node used by the waypoints options. There can be multiple waypoints used by routes.
  
• Number of Routes - 'Show All Routes' uses this field to decide the number of possible routes to show. If total number of routes between two nodes < number of routes, then show every possible route.
  
• Treeview of Routes - 'Show All Routes' displays the routes it found in this treeview. Click on one of the routes to display it on the map.