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 Andris (talk | contribs) at 01:12, 5 June 2004 (pseudocode is fine). 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.

Done. (Copied from minimum spanning tree, actually.) grendel|khan 01:03, 2004 Jun 5 (UTC)

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.

I think the pseudocode I've put down is pretty readable. Maybe I'll convert it to C or Perl or something. grendel|khan 01:03, 2004 Jun 5 (UTC)
Yes, it's quite readable. Andris 01:12, Jun 5, 2004 (UTC)
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Borůvka%27s_algorithm&oldid=9392482"