Latest commit History History 37 lines (32 loc) · 1016 Bytes main Breadcrumbs Dyanmic-Programming-In-C / ...

This program uses Prim's algorith to determine the minimum spanning tree of a weighted graph. In graph theory, graphs are comprised of nodes(u), and edges/vertices(v). The weight of an edge is the ...