Hi, I have a question about implementation of Kruskal minimum spanning tree algorithm. I know it's in desription of algorithm, but is there another reason for testing edges when minimum tree is already complete?
Regards, Janusz _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
