-
For the network below, the objective is to find the length of the shortest path from node P to node G. Let dij be the length of directed arc from node i to node j.
Let sj, be the length of the shortest path from P to node j. Which of the following equations can be used to find SG?
-
- SG = Min {SQ, SR]
- SG = Mn {SQ–dQG, SR–dRG}
- SG = Min [SQ + dQG, SR + dRG]
- SG = Mn [SQG – dRG]
Correct Option: C
The only way to reach G is then by reading Q and then QG or reaching R and then RG.
∴ SG = Min[ SQ + dQG, SR+ dRG]
