Programming in Java

Task 1: Create two input files. Each input file contains two different graphs. The graph should have exactly 10 vertices and exactly 25 edges. One file contains graph in adjacency matrix format and the other file contains graph in adjacent list format.

Task 2: Write methods for BFS in both GraphAdjacencyList and GraphAdjacencyMatrix java classes, which were provided to you.

Task 3: Write methods for DFS in both GraphAdjacencyList and GraphAdjacencyMatrix java classes, which were provided to you.

Task 4: Run both BFS and DFS methods on the two graphs that you created in Task 1 for both GraphAdjacencyList and GraphAdjacencyMatrix java classes. You need to modify GraphTest java file to do this part. You need to modify GraphTest java file to call DFS and BFS method.

Task 5: Write a report based on outputs of Task 4. Your report must describe the followings: (i) code organization, (ii) class inheritance, (iii) description of BFS and DFS method, (iv) description on the outcomes of BFS and DFS methods of the graphs that you created in task 1.