QuestionQ42Verified/Mathematics and StatisticsCopy linkReport a problemAsk AstroTutorSave questionWhich of the following is most appropriately solved using graph theory?AOptical character recognitionBTraveling salesmanCFraud detectionDOne-armed banditShow AnswerAnswerExplanationThe 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.Show comments0Show commentsCommunity DiscussionNo comments yet. Be the first to start the discussion!
Community Discussion