/minimum_spanning_tree_algorithms

The project presents the algorithms of carousel and Prim for finding spanning trees of a simple graph without directions Using: Graph represented by an adjacent list (array of lists) Binary priority heap Union-Find-Set (array of trees with pointers to parents)

Primary LanguageC++

This repository is not active