Read on Wikipedia

Image: Alieseraj · CC BY-SA 3.0

Borůvka's algorithm

Borůvka's algorithm

Method for finding minimum spanning trees.

Super rare
31 views/day0 owners

No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.

No owners yet

Super rareTop 12%

Category: Empty

0 owners
0 copies
0 pulls
Wishlisted
0
In 0 albums
On 0 showcases
Market listings
0
Wikipedia views per dayLast 30 days 1,122

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 389 clicks on its links

  1. Otakar Borůvka

    Czech academic and mathematician.

    40%

  2. Minimum spanning tree

    Least-weight tree connecting graph vertices.

    19%

  3. Prim's algorithm

    Method for finding minimum spanning trees.

    16%

  4. Kruskal's algorithm

    Minimum spanning forest algorithm that greedily adds edges.

    11%

  5. Moravia

    Historical region in the Czech Republic.

    5.9%

Readers come from

Share of the 617 readers arriving from another article

  1. Prim's algorithm

    Method for finding minimum spanning trees.

    27%

  2. Minimum spanning tree

    Least-weight tree connecting graph vertices.

    25%

  3. Kruskal's algorithm

    Minimum spanning forest algorithm that greedily adds edges.

    20%

  4. Otakar Borůvka

    Czech academic and mathematician.

    1.6%