Skip to content

Latest commit

 

History

History
26 lines (16 loc) · 350 Bytes

README.md

File metadata and controls

26 lines (16 loc) · 350 Bytes

MST Kruscal Algorithm

Simple implementation of Kruscal algorithm to find the MST (minimum spanning tree).

Inspired in this IME USP Homework

GRAPH G

plot

MST of G plot

Compile and run

Makefile

$ ~ make

Will genarate a binary called kruscal

$ ~ ./kruscal