Suppose you are given a map (graph G) of a well-developed transportation system

Question

Suppose you are given a map (graph G) of a well-developed transportation system such as Washington Subway, London Underground or Paris Metro. The time it takes the trains to travel between every pair of adjacent stations i and j is Tilil is given. In addition, trains stop at each station for loading and unloading of passengers. The train stop time S[i] depends on how busy the station is, and is known for every station. Develop an algorithm in clearly defined steps or pseudo-code for this transportation system such that when a passenger at a given station enters her/his destination station, the algorithm finds the path with the minimum travel time. Assume the time to wait at a station for the train to arrive and to get on the train is Wi s/2, and it also takes ES[2 to exit the train at the destination.

Explanation / Answer

Solution:

The algorithm is given below:

I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.