1. Kruskal's algorithm is a method of finding:

b. the number of spanning trees that traverse each edge exactly once

Nope, see pages 506 - 507 of the Student Module Text. Also see Session 20; Page 5; Pictures A - D.

Return to Homepage | Question #5