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

a. the number of illegal trees in a graph

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

c. the number of even vertices in a graph

d. mimimal-cost spanning tree

  

Return to Homepage | Question #5