Suppose a college campus decides to install its own phone lines connecting all of the buildings so that calls may be relayed through one or more buildings before reaching their destination. 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

Kruskal's algorithm for finding a minimum-cost spanning tree for a graph would be useful in solving this problem because it would help to find the most efficient way to connect all the buildings with minimum cost. This algorithm is commonly used in network design problems.

Suppose a College Campus Decides to Install Its Own Phone