QuestionQ42

VerifiedMathematics and Statistics

Which of the following is most appropriately solved using graph theory?

Explanation

The traveling salesman problem is modeled as a weighted graph: cities are vertices and routes are edges. The goal is to find a minimum-cost tour that visits every vertex and returns to the starting vertex.

Community Discussion

No comments yet. Be the first to start the discussion!