Prim-Jarnik

Implementation of Prim-Jarknik's algorithm to find the minimum spanning tree of an undirected graph.

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
.gitignore		.gitignore
Makefile		Makefile
README.md		README.md
findMST.c		findMST.c
findMST.h		findMST.h
main.c		main.c

Provide feedback