The shortest route problem requires
A) each destination to be visited only once.
B) finding the quickest route from the source to each node.
C) that there be a branch from each destination to every other destination.
D) that there be no two-way branches between nodes.

Question

Quizplus · Accepted Answer

The shortest route problem involves finding the quickest route from the source to each node, without any restrictions on revisiting nodes or the presence of branches. Option A refers to the traveling salesman problem. Option C describes a fully connected graph, which is not necessary for the shortest route problem. Option D refers to a directed acyclic graph, which is a specific type of graph that may not always apply to the shortest route problem.

The Shortest Route Problem Requires