In this project is realized the algorithm of Prim, which find a Minimum Spanning Tree (MST). It's received a txt file with the numbers of vertex, edges and the edges with their costs. The result is printed in a txt file.
-
Notifications
You must be signed in to change notification settings - Fork 0
caio-k/prim-algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Prim Algorithm Implementation
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published