Home

The mst-algorithms project comprises C++ implementations of three classic Minimum Spanning Tree (MST) algorithms. Namely, Kruskal's, Prim's using Fibonacci heap and Prim's using binomial heap.

This project includes a program (main function) to test the algorithms. This program expects as input a text file describing a weighted graph. See the README file (in Portuguese) for more details about the syntax of this input file.