This project solves a graph optimization problem for a fictional home builder. The builder has a list of potential doors that can connect different rooms in a house. Each door has an associated cost.

This project is a graphical visualization of Kruskal's algorithm implemented in Java using JavaFX. It allows users to input graph data and see the Minimum Spanning Tree (MST) being generated visually.

Abstract: Finding the MST of a weighted connected and undirected graph plays a vital role in different applications of the real world such as effective route finding during navigation, faster ...