Simple implementation of Kruscal algorithm to find the MST (minimum spanning tree).
Inspired in this IME USP Homework
GRAPH G
$ ~ make
Will genarate a binary called kruscal
$ ~ ./kruscal
Simple implementation of Kruscal algorithm to find the MST (minimum spanning tree).
Inspired in this IME USP Homework
GRAPH G
$ ~ make
Will genarate a binary called kruscal
$ ~ ./kruscal