CompTIA DataX (DY0-001) — Question 77

Which of the following is best solved with graph theory?

Answer options

• A. Optical character recognition
• B. Traveling salesman
• C. Fraud detection
• D. One-armed bandit

Correct answer: B

Explanation

The Traveling Salesman problem is a classic example in graph theory where the goal is to find the shortest possible route that visits a set of points and returns to the origin. The other options, while they may involve some level of optimization or pattern recognition, do not primarily rely on graph theoretical approaches to the same extent as the Traveling Salesman problem.