# Find a shortest spanning tree by Kruskals algorithm. Sketch it. 20 (1) (2 6 6, 10 (6) (5 12 2. 4.

Chapter 23, PROBLEM SET 23.4 #2

Find a shortest spanning tree by Kruskal€™s algorithm. Sketch it.

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

**Related Book For**

PROBLEM SET 23.2:

PROBLEM SET 23.4:

PROBLEM SET 23.5:

PROBLEM SET 23.6:

PROBLEM SET 23.7:

PROBLEM SET 23.8: