The most commonly encountered problem associated with weighted graphs is of finding the shortest path between two given vertices. Let us consider the Air Route plan shown below. We just want to find the cheapest route from one city to another.

The Airways charges passengers a fixed fare to travel between any two cities. These fares are shown in the figure. That is, the fare from Muscat to Suhar is OMR 50, from Suhar to Salalah is OMR 90, and so on. The edges are directed. They represent single-track airway routes, on which travel is permitted in only one direction. For example, you can go directly from Muscat to Suhar, but not from Suhar to Muscat. The problem is to find the shortest path which doesnt necessarily mean in terms of distance; it can also mean cheapest, fastest, or best route by some measure. Write a report to analyze the above problem and mention the type of methodology you will adopt as a solution to the problem. Which algorithm is best suited for this problem? And develop a program using the Java programming language to find the shortest path from a specified vertex.

Blackboard Learn > DCourse project 2a-ITDR3X4 Google Translate 1 ? d ? bb.cas.eduom/bbcswebdav/pid-428694-dt-content-rid-1069971-1/coursesATDR3103SOH-18SP-40/Course%20project%202a-ITDR3103-18SP.pdf The most commonly encountered problem associated with weighted graphs is of finding the shortest path between two given vertices. Let us consider the Air Route plan shown below. We just want to find the cheapest route from one city to another SUHAR ABU DHABI OMR 60 OMR 50 OMR 50 OMR 40 OMR 90 MUSCAT A OMR 80 OMR 20 OMR 70 DUBAI SALALAH S:51 PM ?40 ENG 22-Apr-18