Jump to content

Talk:Borůvka's algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 195.137.39.195 (talk) at 21:17, 14 April 2003 (improvements to algorithm?). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Note that Otakar Boruvka's name should really be spelled with a special character, but this is not one of the standard ones on the typewriter keyboard, nor is it in the HTML special character set. The u should have a small circle over the top - equivalent to ů - if that were valid HTML, which it is not!

If someone knows how to do this then feel free to correct the text.


The algorithm given here is not very well expressed. It is hard to find one which is a good description - David Eppstein's (from U. Irvine) is not bad (see http://www.ics.uci.edu/~eppstein/161/960206.html ), though the descriptions from http://www2.toki.or.id/book/AlgDesignManual/LEC/LECTURES/ALL.HTM may be better.