Multiple Choice
In a shortest path problem, when "real travel" through a network can end at more than one node:
I. An arc with length 0 is inserted.
II. The problem cannot be solved.
III. A dummy destination is needed.
A) I only.
B) II only.
C) III only.
D) I and II only.
E) I and III only.
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q35: The figure below shows the possible routes
Q36: The source and sink of a maximum
Q37: The figure below shows the nodes (A-I)
Q38: Network representations can be used for the
Q39: The figure below shows the nodes (A-I)
Q41: The figure below shows the nodes (A-I)
Q42: The figure below shows the nodes (A-I)
Q43: All network optimization problems actually are special
Q44: The figure below shows the possible routes
Q45: A manufacturing firm has four plants