A company is planning to connect its eight small depots (1, 2, 3, 4, 5, 6,...

Transcribed Image Text:

A company is planning to connect its eight small depots (1, 2, 3, 4, 5, 6, 7 and 8) in the London area. The company must develop a system of oil pipelines that makes each depot accessible from every other depot. The distance (in miles) between every pair of depots is as follows: Depot 1 2 3 4 5 6 7 8 1 13 21 9 7 18 20 15 Distance (in miles) between every pair of depots Depot 2 13 - 9 18 12 26 23 11 3 21 9 - 26 17 25 19 10 4 9 18 26 - 7 16 15 9 5 7 12 17 7 - 9 11 8 6 18 26 25 16 9 - 6 10 7 20 23 19 15 11 6 - 5 8 15 11 10 9 8 10 5 The management now wishes to determine between which pairs of depots the pipeline should be constructed to connect all depots with a minimum total length of pipeline to minimise its cost. Perform an analysis of BPL Oil Company's minimal spanning tree problem to connect all depots at the minimal length of pipelines. A company is planning to connect its eight small depots (1, 2, 3, 4, 5, 6, 7 and 8) in the London area. The company must develop a system of oil pipelines that makes each depot accessible from every other depot. The distance (in miles) between every pair of depots is as follows: Depot 1 2 3 4 5 6 7 8 1 13 21 9 7 18 20 15 Distance (in miles) between every pair of depots Depot 2 13 - 9 18 12 26 23 11 3 21 9 - 26 17 25 19 10 4 9 18 26 - 7 16 15 9 5 7 12 17 7 - 9 11 8 6 18 26 25 16 9 - 6 10 7 20 23 19 15 11 6 - 5 8 15 11 10 9 8 10 5 The management now wishes to determine between which pairs of depots the pipeline should be constructed to connect all depots with a minimum total length of pipeline to minimise its cost. Perform an analysis of BPL Oil Company's minimal spanning tree problem to connect all depots at the minimal length of pipelines.

Answer rating: 100% (QA)

to find the MST is Kruskals algorithm So we apply Kruskals algorithm to solve the problem is Sort th... View the full answer