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

Multiple Choice

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