MCQOPTIONS
Saved Bookmarks
| 1. |
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 are 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 ? |
| A. | SG = Min {SO, SR} |
| B. | SG = Min {SO – dOG, SR - dRG} |
| C. | SG = min {SO + dOG, SR + dRG} |
| D. | SG = Min {dOG, dRG} |
| Answer» D. SG = Min {dOG, dRG} | |