Post by: biggirl4568 on Feb 2, 2020
Question 1
Answer true or false.A spanning tree is a subgraph that contains all of a connected graph's vertices, is connected, and contains no circuits.
◦ True
◦ False
Question 2
Use Kruskal's algorithm to find the minimum spanning tree for the weighted graph. Give the total weight of the minimum spanning tree.
◦ 202
◦ 75
◦ 164
◦ 119
Post by: sierrahalpin on Feb 2, 2020
Answer 1
TrueAnswer 2
119