A

Admin • 833K Points
Coach

Q. 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

Explanation by: Admin

refer the tsp problem.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.