Read on Wikipedia

Image: Shiyu Ji · CC BY-SA 4.0

Kruskal's algorithm

Kruskal's algorithm

Minimum spanning forest algorithm that greedily adds edges.

Epic
120 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

EpicTop 5%

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 4,723

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 2,455 clicks on its links

  1. Prim's algorithm

    Method for finding minimum spanning trees.

    15%

  2. Minimum spanning tree

    Least-weight tree connecting graph vertices.

    14%

  3. Borůvka's algorithm

    Method for finding minimum spanning trees.

    5.1%

  4. Dijkstra's algorithm

    Algorithm for finding shortest paths.

    4.7%

  5. Greedy geometric spanner

    1.7%

Readers come from

Share of the 1,745 readers arriving from another article

  1. Minimum spanning tree

    Least-weight tree connecting graph vertices.

    32%

  2. Prim's algorithm

    Method for finding minimum spanning trees.

    21%

  3. Maze generation algorithm

    Automated methods for the creation of mazes.

    8.1%

  4. Borůvka's algorithm

    Method for finding minimum spanning trees.

    2.5%

  5. Martin David Kruskal

    American mathematician (1925-2006).

    1.1%