Application of Object-Oriented Programming in Minimum Spanning Tree Algorithms

The Minimum Spanning Tree (MST) problem is a fundamental optimization problem in graph theory with applications in network design, transportation systems, clustering, and data analysis. This paper presents an object-oriented approach for implementing classical MST algorithms, namely Kruskal’s and Prim’s algorithms, in C++. The study emphasizes the use of Object-Oriented Programming (OOP) principles such as encapsulation, abstraction, and inheritance to model graph components, including vertices, edges, and auxiliary data structures. Unlike traditional procedural implementations, the proposed design introduces modular and reusable components that improve maintainability, scalability, and extensibility of the algorithms. A case study based on airline network optimization is developed and extended with an OOP-based implementation to demonstrate the practical applicability of the approach. Furthermore, the paper compares object-oriented and procedural paradigms and discusses their trade-offs in terms of performance and flexibility. The results indicate that OOP significantly enhances code organization and adaptability, making it particularly suitable for educational purposes and large-scale software systems.