C/C++ or JAVA Coding : BFS, DFS, A*, UCS

This is not a huge project, this is a simple kind of assignment, person expert in C/C++ or JAVA will be able to do it very easily. Here is the information for this. There are two input text files, [login to view URL] and [login to view URL] [login to view URL] The input of your program is a text file containing map of a country with their bus schedules. Now, instead of driving a car, you have to use bus transportation. Instead of using distance, we use travelling time as a step-cost. To depart from one city to another, you need to be at the departure city or standby and wait at the departure city during the bus departure time. The bus will depart according to the given bus departure schedule. Please note that you do not have to worry about accident, traffic jam or under construction road. The text file contains many lines. Each line contains 27 columns. Each column separates by a white space. The first two columns are city names. The third column is a traveling time between two cities in minutes. The next 24 columns are bus schedule and have values only 0 or 1 starting at 1 AM. Example: A B 75 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 This example means that there are bus stations between cities A and B. The travelling time between A and B is 75 minutes. The departure times are at 7AM and 10AM from A to B. On the other hand, the departure times are at 7AM and 10AM from B to A. You can think of it as an undirected graph that the cost between any two cities is symmetric, in this case, traveling time and bus schedule. The total time usage is a combination between waiting time and traveling time. Thus, if you would like to travel from A to B, only 1 minute late arrival to city A (7:01am) will make you miss the 7am bus. Since the next bus schedule is at 10AM, this late arrival will also cause you delayed arrival time to city B for 3 hours. Let’s look at this example, A B 75 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 A C 43 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 According to this schedule, if you arrive to A at 7.00 AM, you can take a bus at 7.00 AM to B. But you need to wait for 1 hour if you want to go to C since the bus to C will depart at 8.00 AM. [login to view URL] This input file contains only two columns. The first column is a city name. The second column is heuristic time in minutes to city E. You will use this file only in A* Search. Given a map file ([login to view URL]) and heuristics information ([login to view URL]) and the start time at city A at 7 AM, find paths from A to E by using graph search for the following 4 search strategies: (1) Implement BFS to find a path from city A to city E (2) Implement DFS to find a path from city A to city E (3) Implement Uniform-cost search to find a minimal- time path from city A to city E (4) Implement A* search to find a minimal-time path from city A to city E For each search strategy (1) to (4), report the following information (a) Solution path. For example, A  B  C  Z E (b) Path-cost in minutes for each step (c) Number of explored nodes (d) Cities in frontier list at each step in (1) to (4). For example, step1: [B C Q] (e) Cities in explored list at each step in (1) to (4). For example, step3: [A B C]