A

Admin • 833K Points
Coach

Q. The travelling salesman problem can be solved using

  • (A) a spanning tree
  • (B) a minimum spanning tree
  • (C) bellman – ford algorithm
  • (D) dfs traversal

Explanation by: Admin

in the travelling salesman problem we have to find the shortest possible route that visits every city exactly once and returns to the starting point for the given a set of cities. so, travelling salesman problem can be solved by contracting the minimum spanning tree.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.