It falls under a class of algorithms called greedy algorithms that find the local optimum in the hopes of finding a global optimum. We start from one vertex and keep adding edges with the lowest ...

This my version of Prim's Algorithm in C. Usually it's recommended that you implement graphing algorithms in Python but I wanted to test myself by using it in C.

Minimum spanning tree is a classical problem in graph theory that plays a key role in a broad domain of applications. This paper proposes a minimum spanning tree algorithm using Prim’s approach on ...