Vidyalelo
Data Structure · Q80

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 80

Q80

The travelling salesman problem can be solved using . . . . . . . .

A.
A spanning tree
B.
A minimum spanning tree
Answer
C.
Bellman - Ford algorithm
D.
DFS traversal

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board
PreviousNext
All Graph Algorithms (DFS, BFS, Dijkstras, etc) questions