 Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2016/functional-programming-design-and-analysis-of-algorithms-resit/8/b/i/solution

True. Every spanning tree contains precisely the vertex set

V

∣ V ∣

nodes, independently of the weights or which minimum tree is chosen.

 New to topics? Read the docs here!