Borůvka's algorithm: Revision history

12 April 2018

• curprev 04:2504:25, 12 April 2018 David Eppstein talk contribs 9,040 bytes −107 →top: given that he wrote in French, is there any evidence that Sollin lived in an English-speaking country or that this is what caused his name to rise to the top? Do we even know his first initial, or does M. stand for monsieur? undo
• curprev 03:3103:31, 12 April 2018 David Eppstein talk contribs 9,147 bytes +200 expand florek ref; fix weird ref footnote placement undo

30 March 2018

• curprev 21:1021:10, 30 March 2018 Pkbwcgs talk contribs m 8,947 bytes 0 v1.43 - WP:WCW project (Heading should end with "=") undo Tag: WPCleaner

19 March 2018

• curprev 15:4815:48, 19 March 2018 2001:718:801:234::5c talk 8,947 bytes +49 No edit summary undo

26 October 2017

• curprev 02:5702:57, 26 October 2017 JCW-CleanerBot talk contribs m 8,898 bytes −2 →top: task, replaced: Comptes-rendu → Comptes Rendu, l’Acad → l'Acad using AWB undo

12 September 2017

• curprev 14:2914:29, 12 September 2017 137.28.230.227 talk 8,900 bytes −1 Removed trailing slash. undo

8 September 2017

• curprev 20:0620:06, 8 September 2017 Jarble talk contribs 8,901 bytes +46 added Category:Articles with example pseudocode using HotCat undo

24 July 2017

• curprev 16:1516:15, 24 July 2017 2.217.0.62 talk 8,855 bytes −4 Fix a typo "are have different component labels" to "have different component labels" undo

23 July 2017

• curprev 03:4103:41, 23 July 2017 David Eppstein talk contribs 8,859 bytes −30 →Other algorithms: still true, update not needed undo
• curprev 03:4103:41, 23 July 2017 David Eppstein talk contribs 8,889 bytes +407 →top: rewrite summary undo
• curprev 03:3603:36, 23 July 2017 David Eppstein talk contribs 8,482 bytes +356 →Pseudocode: What idiot wrote that we should use union-find? Rewrite pseudocode to be the right algorithm undo

4 April 2017

• curprev 18:0618:06, 4 April 2017 128.237.208.151 talk 8,126 bytes +30 →Other algorithms: I remember reading about an algorithm that is optimal for minimum spanning tree but the running time is unknown. Don't have time to update this right now undo

5 February 2017

• curprev 14:3014:30, 5 February 2017 91.99.253.41 talk 8,096 bytes −6 No edit summary undo Tags: Visual edit Mobile edit Mobile web edit
• curprev 14:2914:29, 5 February 2017 91.99.253.41 talk 8,102 bytes +6 No edit summary undo Tags: Visual edit Mobile edit Mobile web edit

8 July 2016

• curprev 19:5519:55, 8 July 2016 Headbomb talk contribs m 8,096 bytes −1 →top: clean up using AWB undo

2 June 2016

• curprev 23:4623:46, 2 June 2016 David Eppstein talk contribs 8,097 bytes +121 Undo good faith edits — the usual version of Boruvka adds an edge for all components at once, and by doing so reduces the #components by a factor of two in linear time. If you only do one component, the time analysis doesn't work. undo
• curprev 23:3823:38, 2 June 2016 JeffAEdmonds talk contribs 7,976 bytes −19 →Pseudocode undo
• curprev 23:3623:36, 2 June 2016 JeffAEdmonds talk contribs 7,995 bytes −102 →Pseudocode undo

25 April 2016

• curprev 23:5723:57, 25 April 2016 Trappist the monk talk contribs m 8,097 bytes −2 cite repair; undo

29 February 2016

• curprev 21:0621:06, 29 February 2016 103.37.201.73 talk 8,099 bytes +63 No edit summary undo

17 January 2016

• curprev 20:5020:50, 17 January 2016 David Eppstein talk contribs m 8,036 bytes −115 Use relative rather than absolute image sizing; max size of lead image is 1.35x. Also rewrite overly repetitve caption which repeatedly says the same thing in multiple words without adding much meaning, and is overly repetitive undo
• curprev 20:3520:35, 17 January 2016 GoodDay talk contribs 8,151 bytes 0 No edit summary undo

12 May 2015

• curprev 07:2807:28, 12 May 2015 132.187.8.58 talk 8,151 bytes −10 →Other algorithms: Dropped days from publication dates. Used html instead of TeX for big-O notation. undo

24 March 2015

• curprev 05:4905:49, 24 March 2015 David Eppstein talk contribs m 8,161 bytes +6 →Complexity: fix undo
• curprev 05:4805:48, 24 March 2015 David Eppstein talk contribs 8,155 bytes +30 →Complexity: Jorge Urrutia undo

27 April 2014

• curprev 15:0315:03, 27 April 2014 Rjwilmsi talk contribs m 8,125 bytes +26 →Other algorithms: Added 1 dois to journal cites using AWB (10081) undo

3 November 2013

• curprev 12:1112:11, 3 November 2013 Alieseraj talk contribs 8,099 bytes +227 No edit summary undo

2 October 2013

• curprev 00:4100:41, 2 October 2013 Cedar101 talk contribs m 7,872 bytes +45 →Pseudocode undo

21 July 2013

• curprev 16:4316:43, 21 July 2013 David Eppstein talk contribs 7,827 bytes +14 →Pseudocode: better explain what T is undo

23 June 2013

• curprev 17:5317:53, 23 June 2013 David Eppstein talk contribs 7,813 bytes +2 Undid revision 561234874 by Falcongl (talk) they are unique when "all edge weights are distinct" (first sentence of the article) undo
• curprev 17:4117:41, 23 June 2013 Falcongl talk contribs m 7,811 bytes −2 →Pseudocode: minimum spanning trees are not unique in general undo

10 April 2013

• curprev 09:2909:29, 10 April 2013 Zaslav talk contribs m 7,813 bytes +1 →Complexity: Ce. undo

8 March 2013

• curprev 08:4908:49, 8 March 2013 Elanguescence talk contribs 7,812 bytes +40 →Pseudocode: Changed line 1 from " 1 Begin with an empty set of edges T" - if T was empty initially, then the loop in line 2 could never take off. undo

25 February 2013

• curprev 19:1119:11, 25 February 2013 Addbot talk contribs m 7,772 bytes −416 Bot: Migrating 12 interwiki links, now provided by Wikidata on d:q1468211 (Report Errors) undo

11 February 2013

• curprev 13:5813:58, 11 February 2013 EmausBot talk contribs m 8,188 bytes +9 r2.7.2+) (Robot: Modifying th:ขั้นตอนวิธีโบรุฟกา to th:ขั้นตอนวิธีของโบรุฟกา undo

21 December 2012

• curprev 13:5113:51, 21 December 2012 Dcoetzee talk contribs 8,179 bytes +15 Dab connected component undo

18 December 2012

• curprev 11:4211:42, 18 December 2012 Dcoetzee talk contribs 8,164 bytes +297 →Other algorithms: Add ref for randomized linear time undo
• curprev 11:3911:39, 18 December 2012 Dcoetzee talk contribs 7,867 bytes −46 →Other algorithms: Remove (actually discovered by Vojtěch Jarník) (that's covered in Prim's algorithm article, not relevant here) undo
• curprev 11:3811:38, 18 December 2012 Dcoetzee talk contribs 7,913 bytes +323 →Other algorithms: Add ref, para undo
• curprev 10:5010:50, 18 December 2012 Dcoetzee talk contribs 7,590 bytes +143 +In graphs where edges have identical weights, edges with equal weights can be ordered based on the lexicographic order of their endpoints. undo
• curprev 10:3110:31, 18 December 2012 Dcoetzee talk contribs 7,447 bytes +3 →Pseudocode undo
• curprev 10:3110:31, 18 December 2012 Dcoetzee talk contribs 7,444 bytes +119 →Pseudocode: +As in Kruskal's algorithm, tracking components of T is straightforward using any disjoint-set data structure. undo
• curprev 10:2810:28, 18 December 2012 Dcoetzee talk contribs 7,325 bytes −31 Simplify while condition and example table, make it just when one component remains undo
• curprev 10:2210:22, 18 December 2012 Dcoetzee talk contribs 7,356 bytes −29 →Example: Remove Ties are broken arbitrarily. - need to have distinct edges, will update images undo
• curprev 10:1510:15, 18 December 2012 Dcoetzee talk contribs 7,385 bytes +4 →Example undo
• curprev 10:0910:09, 18 December 2012 Dcoetzee talk contribs 7,381 bytes +1,052 Add example, based on example at Prim's algorithm undo
• curprev 08:5008:50, 18 December 2012 Dcoetzee talk contribs 6,329 bytes −192 Simplify pseudocode (remove unnecessary intermediate set and simpler/easier to check while loop condition), use unitalicized capital letters undo

4 December 2012

• curprev 10:4310:43, 4 December 2012 Qwertyus talk contribs 6,521 bytes +250 →Pseudocode: reference for Chazelle's algorithm undo

23 August 2012

• curprev 18:3318:33, 23 August 2012 24.199.158.206 talk 6,271 bytes +10 →Pseudocode undo

18 July 2012

• curprev 22:2622:26, 18 July 2012 76.199.15.26 talk 6,261 bytes +26 →Pseudocode undo