- #1
slain4ever
- 63
- 0
Homework Statement
The costs (in millions of dollars) of connecting any two of the four cities A,B,C and D by telephone lines are given in the following matrix:
0 3 5 4
3 0 2 3
5 2 0 6
4 3 6 0
a) Draw a diagram of the complete graph
b) find a minimal spanning tree
The Attempt at a Solution
I honestly have no idea what the question is even asking.
my best guess is that I need to draw a cost vs city bar graph so 2-6 million dollars on the y axis, then fill in for A-B, A-C etc.
is that right?
And I am not 100% sure about minimal spanning trees either. Would you draw 4 vertices labelled A to D then on the connecting lines fill in the proper cost values?