Revision as of 11:17, 17 December 2019 edit Frap (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 35,588 edits →Pseudocode: MOS:ALGO ← Previous edit		Revision as of 03:26, 14 April 2020 edit undo OAbot (talk \| contribs) Bots 643,717 edits m Open access bot: hdl added to citation with #oabot. Next edit →
Line 16: \| title = Otakar Borůvka on minimum spanning tree problem: translation of both the 1926 papers, comments, history \| volume = 233 \| year = 2001~~}}<~~\| hdl = 10338.dmlcz/~~ref>~~500413 \| hdl-access = free }}</ref> The algorithm was rediscovered by [[Gustave Choquet\|Choquet]] in 1938;<ref>{{cite journal \| last = Choquet \| first = Gustave \| authorlink = Gustave Choquet \| year = 1938 \| title = Étude de certains réseaux de routes \| journal = Comptes Rendus de l'Académie des Sciences \| volume = 206 \| pages = 310–313 \| language = French }}</ref> again by [[Kazimierz Florek\|Florek]], [[Jan Łukasiewicz\|Łukasiewicz]], [[Julian Perkal\|Perkal]], [[Hugo Steinhaus\|Steinhaus]], and [[Stefan Zubrzycki\|Zubrzycki]] in 1951;<ref>{{cite journal \| last1 = Florek \| first1 = K.

Borůvka's algorithm: Difference between revisions