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. The program uses a minimum heap data structure to order edges based on lowest weight.
-
Notifications
You must be signed in to change notification settings - Fork 0
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.
Sparsh2234/MST-Greedy-Algorithm-Program
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
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.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published