Suppose an architect needs to design an intercom system for a large office building. Which technique is most likely to be useful in solving this problem?
A) Finding an Euler circuit on a graph
B) Applying the nearest-neighbor algorithm for the traveling salesman problem
C) Applying Kruskal's algorithm for finding a minimum-cost spanning tree for a graph
D) None of these techniques is likely to apply

Question

Quizplus · Accepted Answer

Applying Kruskal's algorithm for finding a minimum-cost spanning tree for a graph would be the most useful technique for designing an intercom system in a large office building. This algorithm can help identify the most efficient way to connect intercoms throughout the building while minimizing costs. Euler circuit and nearest-neighbor algorithms are not applicable in this scenario.

Suppose an Architect Needs to Design an Intercom System for a Large