WikiRNG
Rolled Version rolled

Borůvka's algorithm

Method for finding minimum spanning trees

Borůvka's algorithm is a greedy algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected.

ObscureTop 17%
110,280SP

Badges27 earned

  1. Source CodeObscure+61,703 SP
    Has a code block.
  2. EquationObscure+17,541 SP
    Has a math formula.
  1. All TalkNotable+5,382 SP
    Its talk page is bigger than the article. · Talk page 17,535 bytes, article 10,933
  2. Early DaysNotable+3,988 SP
    Created in 2001 to 2003.
  3. AnonymousNotable+3,128 SP
    Created by someone who wasn't logged in.
  4. ApostropheNotable+3,115 SP
    Title has an apostrophe.
  5. Six-Digit IDNotable+2,264 SP
    Page ID is under 1,000,000. · Page ID 197,253
  6. Free to ReadNotable+1,723 SP
    Cites a source that is free to read.
  7. DiacriticsNotable+1,472 SP
    Title has an accented or non-English letter.
  8. C-ClassNotable+1,137 SP
    Rated C.
  9. NoticedNotable+1,109 SP
    1,000+ views in the last 30 days. · 1,200 views in 30 days
Basic16
rolled by Felaxo