This assignment demonstrates the Prim's algorithm - algorithm that finds a minimum spanning tree for a weighted undirected graph.
-
Notifications
You must be signed in to change notification settings - Fork 0
This assignment demonstrates the Prim's algorithm - algorithm that finds a minimum spanning tree for a weighted undirected graph.
License
Metal666-NAU/prims_algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This assignment demonstrates the Prim's algorithm - algorithm that finds a minimum spanning tree for a weighted undirected graph.