Homework Clinic
Mathematics Clinic => Other Maths => Topic started by: imanialler on May 5, 2020
-
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 second to last?
◦ DE
◦ EH
◦ BC
◦ AB
◦ none of these
-
EH
-
Thank you