Questions 10-13 all refer to the following graph, which has costs associated with each edge:
a. it has a cycle and is therefore not a tree
b. it jumps between two vertices without staying on an edge
c. it doesn't pass through all the vertices
d. it is a spanning tree!
Return to Homepage | Question #12
