Skip to content

Latest commit

 

History

History
2 lines (2 loc) · 239 Bytes

README.md

File metadata and controls

2 lines (2 loc) · 239 Bytes

primAlgorithm

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.