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.
caio-k/prim-algorithm
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|