New telephone lines must be installed to connect 9 cities (A, B, C, D, E, F, G, H and J). Due to government regulations, the only possible connections that are allowed are shown by the edges on the network below. The numbers on the edges indicate the cost (in millions of dollars) of each possible connection. The telephone company wishes to connect the cities in the cheapest possible way.
Using Kruskal's algorithm, which edge is chosen last?
A. EH
B. AB
C. BC
D. DE
E. none of these
Answer: C
Mathematics
You might also like to view...
Write the first six terms of the arithmetic sequence with the first term, a1, and common difference, d.a1 = -27; d = 7
A. -27, -20, -13, -6, 1, 8 B. 1, -6, -13, -20, -27, -34 C. -13, -6, 1, 8, 15, 22 D. -13, -20, -27, -34, -41, -48
Mathematics
Solve the problem.A rectangular field is to be enclosed with 1190 feet of fencing. If the length of the field is 75 feet longer than the width, then how long is the field?
A. 260 ft B. 335 ft C. 410 ft D. 355 ft
Mathematics
Determine whether the matrices are inverses.
, 
A. Yes B. No
Mathematics
Find the value of the combination.C(6, 4)
A. 30 B. 15 C. 180 D. 4
Mathematics