|
|
Boost : |
From: Janusz Piwowarski (jpiw_at_[hidden])
Date: 2003-07-26 02:41:47
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
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk