GitHub / Zilean12 / prim-algorithm
Implement Greedy method (i.e.. Prim's algorithm) to find the minimum spanning tree of a given weighted undirected graph.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Zilean12%2Fprim-algorithm
PURL: pkg:github/Zilean12/prim-algorithm
Stars: 0
Forks: 0
Open issues: 0
License: None
Language: Python
Size: 162 KB
Dependencies parsed at: Pending
Created at: about 2 years ago
Updated at: about 2 years ago
Pushed at: about 2 years ago
Last synced at: 3 months ago
Topics: greedy-algorithm, prims-algorithm, prims-implementation, python
Loading...