SimonIyamu / Prim-Jarnik Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

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

0 stars 0 forks Branches Tags Activity

Notifications

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

Repository files navigation

Prim-Jarnik

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

About

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

prim-jarknik-algorithm

Report repository

Releases

No releases published

Packages

No packages published

Languages