GitHub / Sparsh2234 / MST-Greedy-Algorithm-Program
Implemented MST (Minimum Spanning Tree) for a weighted, undirected graph using Prim’s algorithm. The program uses an 'adjacency list' and 'edge matrix' to support various commands and manipulations. These include: calculating MST value, finding the degree of a vertex, inserting/deleting edges, etc.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sparsh2234%2FMST-Greedy-Algorithm-Program
PURL: pkg:github/Sparsh2234/MST-Greedy-Algorithm-Program
Stars: 0
Forks: 0
Open issues: 0
License: None
Language: C++
Size: 431 KB
Dependencies parsed at: Pending
Created at: over 4 years ago
Updated at: about 2 years ago
Pushed at: over 4 years ago
Last synced at: about 2 years ago
Topics: c-plus-plus, greedy-algorithm, heap-algorithm, mst