Shortest Round Trip Distances from Origin to Destination Using Shortest

Multiple Choice

Shortest round trip distances from origin to destination using shortest route problem is (mark what is true)

A) difficult to find
B) found by using the algorithm another time reversing the origin and destination
C) simply double the shortest route
D) the sum of two distinct paths-one from origin to destination and the other, reverse