2. How long would it take for the ambulance to reach the
airport if the ambulance travels at an average speed of
80 km/hr.
Requirements:
1. Formulate an efficient algorithm to perform the above
task.
2. Provide a description about the design strategy used
3. Analyse the time complexity of the algorithm and
show that it is an "efficient" one.
4. Implement the above problem statement using
programming langugage
Sample Input:
Input should be taken in through a file called
"inputPS3.txt" which has the fixed format mentioned
below using the "/" as a field separator:
<node 1>/<node 2> / <distance in km>
Ex:
a/b/5
b/c/4
a/d/7
Hospital Node: a
Airport Node: o
Note that the input data shown here is only for
understanding and testing, the actual file used for
evaluation will be different
Sample Output:
Shortest route from the hospital 'a' to reach the airport 'o'
is [ a, b, c, j, k, m, o]
and it has minimum travel distance 23km
it will take 17:15 minutes for the ambulance to reach the
airport.
Display the output in outputPS3.txt.
2. Deliverables
• Word document designPS1_<group id>.docx detailing
your algorithm design and time complexity of the algorithm.
• inputPS3.txt file used for testing
• outputPS3.txt file generated while testing
