Which algorithm will always give the optimal tour for a weighted complete graph?
A) Brute-force algorithm
B) Nearest-neighbor algorithm
C) Repetitive nearest-neighbor algorithm
D) Cheapest-link algorithm
E) None of the above.

Question

Which algorithm will always give the optimal tour for a weighted complete graph? 
A) Brute-force algorithm
B) Nearest-neighbor algorithm
C) Repetitive nearest-neighbor algorithm
D) Cheapest-link algorithm
E) None of the above.

Quizplus · Accepted Answer

The brute-force algorithm, by exhaustively checking all possible tours, guarantees finding the optimal tour for a weighted complete graph. It considers every possible sequence of nodes to determine the one with the lowest total weight, ensuring the optimal solution is found, albeit at a high computational cost for large graphs.

Which Algorithm Will Always Give the Optimal Tour for a Weighted