Mathematics Clinic > Pre-calculus

Answer true or false. A minimum spanning tree for a weighted graph is a spanning tree with the ...

(1/1)

Coya19@aol.com:
Question 1A 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 2Answer true or false.

A minimum spanning tree for a weighted graph is a spanning tree with the smallest possible total weight.
◦ false
◦ true

briezy:
Answer 1526 feet


Answer 2true

Aidan Shelledy:
Thank u

Aidan Shelledy:
Thank yoy

Navigation

[0] Message Index