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:

c. AFGCDHE

Nope, While this results, as the graph below shows, in a low total, it is not a spanning tree. Note that it never visits vertex B.

Question #13