Skip to content

Latest commit

 

History

History
2 lines (2 loc) · 210 Bytes

README.md

File metadata and controls

2 lines (2 loc) · 210 Bytes

MinimumSpanningTree

A program that solves the problem of finding a minimum spanning tree in undirected graphs according to the Kruskal and Prim algorithm and executing all the data structures in the program.