mst-solver

A desktop application based on PyQt5 to solve the minimum spanning tree problem. The app also implement clustering by using the MST algorithm.

Usage

Clone the repository
Install the dependencies
Run the app by python src/ui.py
Choose the input file (the format of the input file is an adjacency matrix of the graph, see the files in test for examples)
If you want to add or remove edges, the top three top input boxes are for you. The first one is the start vertex, the second one is the end vertex, and the last one is the weight of the edge. After you input the information, click the Add button to add the edge, or click the Del button to remove the edge. When you are deleting an edge you don't need to input the weight.
If you want to add or remove vertices, the middle input box is for you. Input the vertex number you want to add or remove, and click the Add or Del button.
Select the algorithm you want to use, and click the Find MST button to find the MST of the graph.
For the clustering part, you can choose the number of clusters you want to have by inputing the number at the bottom input box, and click the Find Cluster button to find the clusters of the graph.
The reset button is for you to reset the graph to the original graph.