Skip to content
#

minimum-spanning-trees

Here are 9 public repositories matching this topic...

This project developed along the discipline of "Algorithms and Data Structures" at UFMG uses an implementation of the Krushkal algorithm to calculate the Minimum Spanning Tree of a graph. The file "entrada.txt" must contain the nodes and edges of the graph as follows: - The first line must contain the number of nodes and the number of edges of t…

  • Updated Apr 30, 2021
  • C

Improve this page

Add a description, image, and links to the minimum-spanning-trees topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the minimum-spanning-trees topic, visit your repo's landing page and select "manage topics."

Learn more