Kruskal Algorithm
Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect
Author: Nickolas Cheilakos
the code of 'connected' function is not correct. if you want to use this code you have to correct it (it is simple to do). but i think that the code is verry simple to understand and to use.
an other think, we can use the matlab function max(PV,3)' in the place of "fysalida.m"
thanks
