Question

100. 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
c) Map coloring problem
d) Depth first search traversal on a given map represented as a graph

Answer 1

Answer:

d) Depth first search traversal on a given map