Please fill out this quiz, and press the "Submit"
button at the end.
Don't collaborate with anyone on quiz exercise solutions.
Please answer all questions.
[No spaces and no dashes.]
Login ID :
1. Let G be an undirected graph with costs on the edges, and let e be the edge with lowest cost.
Suppose that no other edge has the same or lower cost as e (so the lowest-cost edge is unique).
Are we guaranteed that every minimum spanning tree of G will contain e?
Why or why not? A sentence or two of justification will suffice.