Project information

• Category: Data Structures & Algorithms
• Completion Date: April 3, 2021
• Technologies Used: C++
• GitHub URL: MST Maintenance Repo

Dynamic MST Maintenance for Graphs transforms graphs to MSTs (Minimum Spanning Trees). The program is designed to handle undirected graphs with weighted edges. It allows users to input such a graph, compute an initial Minimum Spanning Tree (MST) for the graph using Prim's algorithm, and then update the MST dynamically as changes occur in the graph structure. These changes include the insertion and deletion of vertices, insertion and deletion of edges, and changing the weights of edges. Utlizing a console interface to perform these operations either via file input, keyboard input, or a combination of both. It employs various data structures and algorithms, including adjacency matrices, binary heaps, and Dijkstra's algorithm for pathfinding, to efficiently manage and update the graph and its MST.