Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

What is the minimum spanning tree for this undirected graph? Thanks ? ? ? pa2-a-

ID: 3703330 • Letter: W

Question

What is the minimum spanning tree for this undirected graph? Thanks

? ? ? pa2-a-1.pdf Xtsp-slides-cs315s18.pdf ? ? O??file:///Cyusers/BAILEY~1/AppData/Local/Temp/pa2-a-1.pdf ?? 2 of2 8.944.12 4.12 5.83 3.60 3.16 6.40 12.04 7.616.08 9.89 5.83 2.23 4.47 3.60 6.08 7.61 2.23 6.78 4.0? 6.08 8.06 5.09 6.08 5.0? 9.95 3.60 4.00 7.8 2.82 9.48 9.88 8.6? 3.60 1.08 4.12 7.21 3.68 4.47 7.28 8.24 6.40 10.81 2.82 8.06 B 8.94 0 C 4.12 6.4? ? D 4.12 12.04 5.83 E 5.83 7.61 2.23 6.08 3.6? 6.08 4.47 7.61 6.70 G 3.16 9.89 3.602.23 4. 6.08 ? 8.96 5.00 4.00 9.48 3.68 7.21 7.28 I 5.09 9.05 7.81 9.00 10. 3.6 8.24 6.98 3.6? 2.82 8.68 4.12 4.47 6.40 10.81 2.82 ? 8.96 ? Figure 2: Instance pa2a 2 O Type here to search 11:06 ?? 48/2018 8

Explanation / Answer

The edges in the minimum spannig tree are as follows

(C,E): 2.23
(D,G): 2.23
(C,J): 2.82
(H,J): 2.82
(A,G): 3.16
(A,F): 3.6
(B,J): 3.6
(C,G): 3.6
(F,I): 3.6

The cost of MST is: 27.66