Talk:Borůvka's algorithm: Difference between revisions

Revision as of 21:17, 14 April 2003

Revision as of 01:03, 5 June 2004

Line 3:

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

:Done. (Copied from [[minimum spanning tree]], actually.) [[User:Grendelkhan|grendel]]|[[User_talk:Grendelkhan|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. [[User:Grendelkhan|grendel]]|[[User_talk:Grendelkhan|khan]] 01:03, 2004 Jun 5 (UTC)