Question

A company needs to connect 5 buildings with cable. B 10 C 15 21 12 7 6 A 3 D 5 E Q a) If the company wants to construct a full loop (circuit) of cable, use the Nearest Neighbor algorithm, starting at building A. b) If the company wants to construct a minimum cost spanning tree, find it using Kruskal's algorithm. List the included edges, separated by commas.

          A company needs to connect 5 buildings with cable.
B
10
C
15
21
12
7
6
A
3
D
5
E
Q
a) If the company wants to construct a full loop (circuit) of cable, use the Nearest Neighbor algorithm,
starting at building A.
b) If the company wants to construct a minimum cost spanning tree, find it using Kruskal's algorithm. List
the included edges, separated by commas.

A company needs to connect 5 buildings with cable.
B
10
C
15
21
12
7
6
A
3
D
5
E
Q
a) If the company wants to construct a full loop (circuit) of cable, use the Nearest Neighbor algorithm,
starting at building A.
b) If the company wants to construct a minimum cost spanning tree, find it using Kruskal's algorithm. List
the included edges, separated by commas.

Added by Kristopher M.

Elementary and Intermediate Algebra

Alan S. Tussy, R. David Gustafson 5th Edition

Instant Answer

Solved by Expert Leslie Deeb

Step 1

We will represent the distances between the buildings as a weighted graph. Step 1: Sort the edges in ascending order of their weights. AB: 5, AC: 7, AD: 8, AE: 10, BC: 6, BD: 9, BE: 11, CD: 4, CE: 3, DE: 6 Sorted edges: CE: 3, CD: 4, AB: 5, BC: 6, DE: 6, AC: 7, Show more…

Show all steps

Thanks for your feedback!

Company needs to connect buildings with cable: 4) If the company wants to construct starting at building a full loop (circuit) of cable, use the Nearest Neighbor algorithm. If the company wants to construct a minimum cost spanning tree, find using Kruskal's algorithm. List the included edges, separated by commas.