Which of the following is an application of a shortest path problem?
I. Minimize total distance traveled.
II. Minimize total flow through a network.
III. Minimize total cost of a sequence of activities.
IV. Minimize total time of a sequence of activities
A) I and II only
B) I, II, and III only.
C) IV only
D) I, II, III, and IV
E) I, III, and IV only.

Question

Quizplus · Accepted Answer

Shortest path problems are primarily concerned with minimizing some form of distance or cost between points in a network. This can include minimizing the total distance traveled (I), the total cost of a sequence of activities (III), and the total time of a sequence of activities (IV). Minimizing total flow through a network (II) is not typically a shortest path problem but rather a network flow problem.

Which of the Following Is an Application of a Shortest