GitHub / AvivBk / 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)
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AvivBk%2Fminimum_spanning_tree_algorithms
PURL: pkg:github/AvivBk/minimum_spanning_tree_algorithms
Stars: 0
Forks: 0
Open issues: 0
License: None
Language: C++
Size: 28.3 KB
Dependencies parsed at: Pending
Created at: about 3 years ago
Updated at: about 3 years ago
Pushed at: about 3 years ago
Last synced at: about 2 years ago
Topics: carousel, graph, heap, prim-algorithm, spanning-trees, union-find