Questions 10-13 all refer to the following graph, which has costs associated with each edge:

  1. The following tree is a minimum-cost spanning tree:

a. EHGFABCD

Nope, While this is, as the graph below shows, a spanning tree, it is not the minimum-cost. Another spanning tree can be made that is less expensive.

Return to Homepage | Question #13