MirunaPislar / Prim-s-Minimum-spanning-tree-algorithm

Given an undirected graph and a cost for each edge of the graph we compute the minimum cost tree that spans all vertices.

Geek Repo

Github PK Tool