(Choose 1 answer)
The shortest tour.is a touring problem in which each city must be visited exactly once. The aim is to find the
A. Finding shortest path between a source and a destination
B. Travelling Salesman problem
C. Map coloring problem
D. Depth first search traversal on a given map represented as a graph
the exam.
Exit 23
