COMP20010: The objective of this team CA exercise is to create a JavaFX application that can search for and retrieve routes between points: Data Structures and Algorithms I Assignment, UCD, Ireland

The objective of this team CA exercise is to create a JavaFX application that can search for and retrieve routes between points/landmarks in Waterford City given a starting point and destination. The application should create/generate the following on request:

• Multiple route permutations between a starting point/landmark and a destination .
• The shortest route between the starting point/landmark and destination.
• This functionality should come in two forms: one using Dijkstra’s algorithm and one using breadth-first search.
• Most cultural/historic routes are based on some estimate of the cultural/historic importance of route points and/or the general area, such as the “Viking Triangle between the starting point/landmark and destination.

The application should also allow users to specify points/landmarks to avoid on the route and to also specify points/landmarks that must be visited on the route to the final destination. A suitable “blank” vector map of Waterford should be used. For example (there are other smaller and less detailed versions available; use whatever appropriate one you like):

The post COMP20010: The objective of this team CA exercise is to create a JavaFX application that can search for and retrieve routes between points: Data Structures and Algorithms I Assignment, UCD, Ireland appeared first on QQI Assignments.