Question: 6. Devise an algorithm (write down a pseudocode or clearly describe the steps of your algorithm) that will compute the minimum number of transfers needed

6. Devise an algorithm (write down a pseudocode or clearly describe the steps of your algorithm) that will compute the minimum number of transfers needed to fly from one city to another for a given flight network of an airline company. Assume that you only know the direct flights n cities. Find also the complexity of your algorithm as a function of n, the number of cities in the network. Your algorithm should output the minimum number of transfers between every ordered pair of cities
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
