CompTIA
DY0-001 · Question #34
Which of the following is best solved with graph theory?
Sign in or unlock DY0-001 to reveal the answer and full explanation for question #34. The question stem and answer options stay visible for context.
Mathematics and Statistics
Question
Which of the following is best solved with graph theory?
Options
- AOptical character recognition
- BTraveling salesman
- CFraud detection
- DOne-armed bandit
Unlock DY0-001 to see the answer
You've previewed enough free DY0-001 questions. Unlock DY0-001 for full answers, explanations, the timed quiz mode, progress tracking, and the master PDF. Question stem and options stay visible so you can still see what's on the exam.
Topics
#graph theory#traveling salesman problem#network analysis#combinatorial optimization