Can anyone help me providing the coding for the following
1. The Main Algorithm. Let us assume that we have a request to find a sequence of
flights from X to Y. The request must be processed in the following way:
I We create an empty stack;
II All cities are marked as 搖nvisited?
III We mark city X as 搗isited?and push it onto the stack;
IV While the stack is not empty and top city in the stack is not the destination city Y:
?If there is some 搖nvisited?city adjacent to the top city, we mark it as 搗isited?br>and push it onto the stack
?Else we pop the stack
IV Return the stack. If the stack is not empty it contains the sequence of flights from X to
Y. If the stack is empty, such sequence does not exist.
2.Generic classes Stack<T> and List<T> :Create generic classes
Stack<T> and List<T>. You need to make necessary changes to the classes Stack and List
discussed in the lectures. Class Stack<T> must contain a method that prints contents of
the stack.
3.Class City : Create a class City, which has the following instance variables:
?private String name; // name of the city
?private List<City> nextCities; // List of cities to which there is a flight from this
?private boolean visited; // the variable that shows whether the city has been
//already visited during the request processing algorithm.
The class also must contain constructor(s) and get and set methods for the instance
variables.
There also must be a method 損ublic City getNextUnvisitedCity()?which returns some
搖nvisited?city from the nextCities list, if there is any, otherwise returns null.
4. Class RequestProcessor :. This class has one instance
variable: 損rivate List<City> cities?which refers to the list of City objects in the flight
map;
A constructor that receives a parameter of List<City> type to initialize the instance
variable;
And two methods:
?損ublic Stack<City> isPath(City originCity, City destinationCity)?method
implements the Main Algorithm described in section 1.
?main method, in which you create 9 cities according to the information given in
the flight map (figure in section 0) and then process customer requests for three
different pairs of cities (you can choose the pairs yourself).
Can any one Help me with the coding
