8 HOURS DELIVERY: PLAGIARISM FREE AND QUALITY WORK GUARANTEED.

• Travel and Tourism Management System (TTMS): The objective is to develop a TTM

• Travel and Tourism Management System (TTMS): The objective is to develop a
TTMS system that automates the processes and activities of a travel and tourism agency.
The purpose is to design a system which one can use to perform all operations related to
traveling and sight-seeing. The system allows one to easily access the relevant information
and make necessary travel arrangements. Users can decide about places they want to visit
and make bookings online for travel and accommodation.
The project should be an extension of the topics discussed in class and include
concepts related to
– Classes and methods defined in OOP-style
– Abstract classes, Inheritance and Polymorphism
– Exceptions and Assertions

So this project is basically 2 parts and I have already completed part 1 of the

So this project is basically 2 parts and I have already completed part 1 of the project last month, and so now for the second part I need to modify my source codes from my files from part 1 of the project to include extra features and methods in part 2 instructions. Below I will provide both PDFs from each part of the Java project. The part 1 PDF (as CECS 277-Project1) includes the expected output that I got from the source code (pokemon project 1.txt) and so for part 2 PDF (CECS 277-Project2), I need to modify that source code with the files to include new features and edits as required in the part 2 PDF instructions. I will also include a task list (ATasks) of what needs to be updated for part 2 of this project. Pokemon List text is also provided as well and Area1,2, and 3 text files will also be included for the Map class for Part 2. Thank you very much.
**Reminder: pokemon project 1.txt is the completed code from CECS277-Project1.pdf that will need to be modified in CECS277-Project2(1).pdf and through ATasks.PNG with provided text files:PokemonList.txt, Area1.txt, Area2.txt, and Area3.txt.**

Let G = (V, E) be a directed graph in which the vertices are labeled from 1 to |

Let G = (V, E) be a directed graph in which the vertices are labeled from 1 to |V|. For each vertex u, find the vertex v that is reachable from u (i.e., there is a path from u to v, or u and v are the same), and v has the smallest label among all the vertices reachable from u. For example, for the graph in Figure 22.2, the result should be 1→1, 2→2, 3→2, 4→2, 5→2, 6→6.
The solution is to construct the transpose of G, GT, then call DFS on the vertices in increasing order.
The program should be in JAVA and should take in a matrix from a text file.
I have been having trouble getting the right result. I need it to look like the picture attached. Thank you so much!

This is a group project. We have to make any database system application. For th

This is a group project. We have to make any database system application. For the front-end design, we can use the Java swing classes and for the back-end, we have to store the data in a SQL database. We were thinking of either doing a store management system or a library management system. Please let me know if anyone can complete it before the deadline. The presentation and the project report can be done by us.