Assignment is based on Discrete structure.

$*$Chapter $/$Category :

Graph: Spanning Tree

$*$Algorithm $/$ Approach:

Kruskal algorithm

How can we leverage the Kruskal algorithm to determine a minimum spanning tree for the transportation networks linking Johor Bahru, Melaka, Selangor, and Kuala Lumpur, addressing issues of inefficiency and high construction costs?

$1.$

$$Problem Exploration: Explore the application of the minimum spanning tree for the connection network between Johor Bahru, Melaka, Selangor, and Kuala Lumpur, found using Kruskal's algorithm

$2.$

$$Mathematical Model Creation: Develop a mathematical representation, utilizing graph theory, to depict the cities as vertices and the transportation connections as edges, considering the inefficiencies and cost challenges outlined in the case study.

$3.$

$$Development: Implement a suitable program or construct a graph data structure that incorporates relevant algorithms, enabling the application of Kruskal's algorithm to find the minimum spanning tree for the transportation network between the cities.

$4.$

$$Analytical Overview: Provide an analytical breakdown of the results obtained from the Kruskal algorithm application, outlining the optimized transportation layout and its potential impact on reducing inefficiencies and excessive construction costs.