Optimizing Network Connections with MST and Shortest Path
A telecommunications company is designing a network to connect six cities (A, B, C, D, E, F) with communication cables. The distances between cities (in km) are given as weighted edges in the following network graph:\n\n- City A to City B: 4 km\n- City A to City C: 3 km\n- City B to City C: […]