Q664
The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour.
A.
Finding shortest path between a source and a destination
B.
Travelling Salesman problem
AnswerC.
Map coloring problem
D.
Depth first search traversal on a given map represented as a graph
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board