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 C++ code implements a Graph data structure and includes various graph algorithms such as Dijkstra's shortest path algorithm and Kruskal's Minimum Spanning Tree (MST) algorithm. It is divided into ...

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 ...