Well, this would explain it and gives the correct output. Now my other question: Why is this implemented like this? A minimum spanning tree does not make sense in a not weighted Graph and as far as I read the documentation, "Is G weighted" is part of the sanity checks that is performed in the kruskal Algorithm if check = True. Maybe I am not seeing something elementary here, but I think that it should by default take the weight-function into account.
Cheers -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
