Homework Clinic

Mathematics Clinic => Pre-calculus => Topic started by: Coya19@aol.com on Feb 2, 2020

Title: Answer true or false. A minimum spanning tree for a weighted graph is a spanning tree with the ...
Post by: Coya19@aol.com on Feb 2, 2020

Question 1

A corporate campus plans to run computer network cable between buildings. Use Krustal's algorithm to find the minimum spanning tree that allows the network to connect all the buildings. How much cable is needed?


◦ 526 feet

◦ 912 feet

◦ 870 feet

◦ 547 feet


Question 2

Answer true or false.

A minimum spanning tree for a weighted graph is a spanning tree with the smallest possible total weight.
◦ false
◦ true
Title: Answer true or false. A minimum spanning tree for a weighted graph is a spanning tree with the ...
Post by: briezy on Feb 2, 2020

Answer 1

526 feet


Answer 2

true
Title: Re: Answer true or false. A minimum spanning tree for a weighted graph is a spanning tree with the .
Post by: Aidan Shelledy on Jul 15, 2022
Thank u
Title: Re: Answer true or false. A minimum spanning tree for a weighted graph is a spanning tree with the .
Post by: Aidan Shelledy on Jul 21, 2022
Thank yoy