Suppose XYZ Drilling has four oil wells that must be connected via pipelines to a storage tank. The cost of each pipeline (in millions of dollars) is shown in the following table:

a. Represent this information with a weighted graph.

b. Use Kruskal’s algorithm to find a minimum spanning tree.

c. What is the minimum cost that links together all of the wells and the tank?

Transcribed Image Text:

From/To #1 #2 #3 #4 Tank #1 1 4 2 3 #2 1 3 1 2 #3 4 3 1 4 #4 2 1 1 1 Tank 3 2 4 1 |